/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_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 06:21:11,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 06:21:11,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 06:21:11,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 06:21:11,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 06:21:11,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 06:21:11,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 06:21:11,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 06:21:11,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 06:21:11,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 06:21:11,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 06:21:11,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 06:21:11,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 06:21:11,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 06:21:11,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 06:21:11,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 06:21:11,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 06:21:11,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 06:21:11,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 06:21:11,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 06:21:11,440 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 06:21:11,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 06:21:11,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 06:21:11,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 06:21:11,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 06:21:11,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 06:21:11,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 06:21:11,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 06:21:11,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 06:21:11,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 06:21:11,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 06:21:11,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 06:21:11,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 06:21:11,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 06:21:11,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 06:21:11,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 06:21:11,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 06:21:11,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 06:21:11,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 06:21:11,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 06:21:11,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 06:21:11,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 06:21:11,459 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 06:21:11,467 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 06:21:11,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 06:21:11,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 06:21:11,469 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 06:21:11,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 06:21:11,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 06:21:11,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 06:21:11,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 06:21:11,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 06:21:11,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 06:21:11,470 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 06:21:11,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 06:21:11,470 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 06:21:11,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 06:21:11,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 06:21:11,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 06:21:11,470 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 06:21:11,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 06:21:11,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:21:11,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 06:21:11,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 06:21:11,471 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 06:21:11,471 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 06:21:11,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 06:21:11,471 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 06:21:11,471 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-08 06:21:11,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 06:21:11,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 06:21:11,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 06:21:11,666 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 06:21:11,666 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 06:21:11,667 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound50.c [2022-04-08 06:21:11,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc33d58a/7f1a1c1f9d534188989e8d4e51472f01/FLAG18ff53b1b [2022-04-08 06:21:12,061 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 06:21:12,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound50.c [2022-04-08 06:21:12,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc33d58a/7f1a1c1f9d534188989e8d4e51472f01/FLAG18ff53b1b [2022-04-08 06:21:12,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc33d58a/7f1a1c1f9d534188989e8d4e51472f01 [2022-04-08 06:21:12,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 06:21:12,085 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 06:21:12,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 06:21:12,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 06:21:12,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 06:21:12,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:21:12" (1/1) ... [2022-04-08 06:21:12,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e7201e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:21:12, skipping insertion in model container [2022-04-08 06:21:12,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:21:12" (1/1) ... [2022-04-08 06:21:12,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 06:21:12,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 06:21:12,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound50.c[538,551] [2022-04-08 06:21:12,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:21:12,263 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 06:21:12,276 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_unwindbound50.c[538,551] [2022-04-08 06:21:12,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:21:12,300 INFO L208 MainTranslator]: Completed translation [2022-04-08 06:21:12,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:21:12 WrapperNode [2022-04-08 06:21:12,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 06:21:12,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 06:21:12,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 06:21:12,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 06:21:12,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:21:12" (1/1) ... [2022-04-08 06:21:12,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:21:12" (1/1) ... [2022-04-08 06:21:12,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:21:12" (1/1) ... [2022-04-08 06:21:12,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:21:12" (1/1) ... [2022-04-08 06:21:12,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:21:12" (1/1) ... [2022-04-08 06:21:12,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:21:12" (1/1) ... [2022-04-08 06:21:12,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:21:12" (1/1) ... [2022-04-08 06:21:12,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 06:21:12,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 06:21:12,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 06:21:12,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 06:21:12,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:21:12" (1/1) ... [2022-04-08 06:21:12,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:21:12,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:21:12,367 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-08 06:21:12,383 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-08 06:21:12,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 06:21:12,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 06:21:12,399 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 06:21:12,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 06:21:12,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 06:21:12,399 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 06:21:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 06:21:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 06:21:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 06:21:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 06:21:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 06:21:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 06:21:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 06:21:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 06:21:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 06:21:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 06:21:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 06:21:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 06:21:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 06:21:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 06:21:12,443 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 06:21:12,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 06:21:12,569 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 06:21:12,573 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 06:21:12,574 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 06:21:12,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:21:12 BoogieIcfgContainer [2022-04-08 06:21:12,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 06:21:12,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 06:21:12,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 06:21:12,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 06:21:12,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 06:21:12" (1/3) ... [2022-04-08 06:21:12,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bede88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:21:12, skipping insertion in model container [2022-04-08 06:21:12,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:21:12" (2/3) ... [2022-04-08 06:21:12,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bede88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:21:12, skipping insertion in model container [2022-04-08 06:21:12,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:21:12" (3/3) ... [2022-04-08 06:21:12,580 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound50.c [2022-04-08 06:21:12,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 06:21:12,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 06:21:12,644 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 06:21:12,649 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-08 06:21:12,649 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 06:21:12,663 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-08 06:21:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 06:21:12,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:21:12,668 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-08 06:21:12,669 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:21:12,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:21:12,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-08 06:21:12,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:12,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1895193820] [2022-04-08 06:21:12,690 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:21:12,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 2 times [2022-04-08 06:21:12,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:21:12,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343407428] [2022-04-08 06:21:12,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:21:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:21:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:12,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:21:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:12,868 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-08 06:21:12,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 06:21:12,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-08 06:21:12,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 06:21:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:12,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 06:21:12,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 06:21:12,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 06:21:12,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-08 06:21:12,876 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-08 06:21:12,876 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-08 06:21:12,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 06:21:12,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-08 06:21:12,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-08 06:21:12,877 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-08 06:21:12,877 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-08 06:21:12,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 06:21:12,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 06:21:12,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 06:21:12,878 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-08 06:21:12,878 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-08 06:21:12,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-08 06:21:12,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-08 06:21:12,878 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-08 06:21:12,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-08 06:21:12,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-08 06:21:12,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-08 06:21:12,879 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-08 06:21:12,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:21:12,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343407428] [2022-04-08 06:21:12,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343407428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:12,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:12,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:21:12,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:21:12,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1895193820] [2022-04-08 06:21:12,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1895193820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:12,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:12,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:21:12,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208231283] [2022-04-08 06:21:12,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:21:12,886 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-08 06:21:12,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:21:12,889 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-08 06:21:12,920 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-08 06:21:12,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 06:21:12,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:12,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 06:21:12,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 06:21:12,941 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-08 06:21:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:13,128 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-08 06:21:13,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 06:21:13,128 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-08 06:21:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:21:13,130 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-08 06:21:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-08 06:21:13,143 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-08 06:21:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-08 06:21:13,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-08 06:21:13,255 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-08 06:21:13,261 INFO L225 Difference]: With dead ends: 66 [2022-04-08 06:21:13,261 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 06:21:13,263 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-08 06:21:13,265 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-08 06:21:13,266 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-08 06:21:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 06:21:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-08 06:21:13,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:21:13,302 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-08 06:21:13,303 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-08 06:21:13,303 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-08 06:21:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:13,306 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-08 06:21:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-08 06:21:13,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:13,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:13,308 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-08 06:21:13,308 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-08 06:21:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:13,327 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-08 06:21:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-08 06:21:13,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:13,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:13,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:21:13,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:21:13,329 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-08 06:21:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 06:21:13,340 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-08 06:21:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:21:13,340 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 06:21:13,341 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-08 06:21:13,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 06:21:13,387 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-08 06:21:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 06:21:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 06:21:13,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:21:13,389 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-08 06:21:13,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 06:21:13,389 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:21:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:21:13,391 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-08 06:21:13,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:13,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2049069030] [2022-04-08 06:21:13,398 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:21:13,399 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 2 times [2022-04-08 06:21:13,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:21:13,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218933375] [2022-04-08 06:21:13,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:21:13,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:21:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:13,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:21:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:13,498 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-08 06:21:13,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-08 06:21:13,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-08 06:21:13,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 06:21:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:13,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-08 06:21:13,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-08 06:21:13,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-08 06:21:13,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-08 06:21:13,507 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-08 06:21:13,507 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-08 06:21:13,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-08 06:21:13,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-08 06:21:13,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} call #t~ret8 := main(); {314#true} is VALID [2022-04-08 06:21:13,508 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-08 06:21:13,508 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-08 06:21:13,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-08 06:21:13,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-08 06:21:13,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-08 06:21:13,509 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-08 06:21:13,510 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-08 06:21:13,510 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-08 06:21:13,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {323#(= main_~q~0 0)} assume !!(#t~post6 < 50);havoc #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-08 06:21:13,511 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-08 06:21:13,512 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-08 06:21:13,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {325#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {315#false} is VALID [2022-04-08 06:21:13,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} assume !false; {315#false} is VALID [2022-04-08 06:21:13,515 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-08 06:21:13,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:21:13,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218933375] [2022-04-08 06:21:13,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218933375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:13,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:13,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:21:13,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:21:13,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2049069030] [2022-04-08 06:21:13,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2049069030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:13,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:13,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:21:13,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792381787] [2022-04-08 06:21:13,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:21:13,521 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-08 06:21:13,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:21:13,521 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-08 06:21:13,536 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-08 06:21:13,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:21:13,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:13,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:21:13,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:21:13,537 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-08 06:21:13,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:13,845 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-08 06:21:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:21:13,845 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-08 06:21:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:21:13,846 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-08 06:21:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-08 06:21:13,851 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-08 06:21:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-08 06:21:13,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-08 06:21:13,909 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-08 06:21:13,913 INFO L225 Difference]: With dead ends: 47 [2022-04-08 06:21:13,913 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 06:21:13,914 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-08 06:21:13,916 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-08 06:21:13,916 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-08 06:21:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 06:21:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-08 06:21:13,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:21:13,930 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-08 06:21:13,930 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-08 06:21:13,931 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-08 06:21:13,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:13,933 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-08 06:21:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-08 06:21:13,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:13,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:13,934 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-08 06:21:13,934 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-08 06:21:13,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:13,941 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-08 06:21:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-08 06:21:13,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:13,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:13,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:21:13,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:21:13,943 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-08 06:21:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-08 06:21:13,945 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-08 06:21:13,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:21:13,946 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-08 06:21:13,946 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-08 06:21:13,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-08 06:21:13,981 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-08 06:21:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-08 06:21:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 06:21:13,982 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:21:13,983 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-08 06:21:13,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 06:21:13,983 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:21:13,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:21:13,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-08 06:21:13,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:13,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [669410891] [2022-04-08 06:21:13,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:21:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 2 times [2022-04-08 06:21:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:21:13,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834525630] [2022-04-08 06:21:13,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:21:13,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:21:13,994 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:21:13,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1677292293] [2022-04-08 06:21:13,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:21:13,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:21:13,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:21:13,996 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-08 06:21:13,997 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-08 06:21:14,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:21:14,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:21:14,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 06:21:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:14,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:21:14,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-08 06:21:14,197 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-08 06:21:14,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:14,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#(<= ~counter~0 0)} {593#true} #96#return; {601#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:14,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#(<= ~counter~0 0)} call #t~ret8 := main(); {601#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:14,199 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-08 06:21:14,200 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-08 06:21:14,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#(<= ~counter~0 0)} ~cond := #in~cond; {601#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:14,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#(<= ~counter~0 0)} assume !(0 == ~cond); {601#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:14,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:14,201 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {601#(<= ~counter~0 0)} {601#(<= ~counter~0 0)} #80#return; {601#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:14,201 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-08 06:21:14,202 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-08 06:21:14,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {635#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {594#false} is VALID [2022-04-08 06:21:14,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {594#false} is VALID [2022-04-08 06:21:14,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#false} assume !(#t~post7 < 50);havoc #t~post7; {594#false} is VALID [2022-04-08 06:21:14,203 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-08 06:21:14,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#false} ~cond := #in~cond; {594#false} is VALID [2022-04-08 06:21:14,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#false} assume 0 == ~cond; {594#false} is VALID [2022-04-08 06:21:14,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-08 06:21:14,203 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-08 06:21:14,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:21:14,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:21:14,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834525630] [2022-04-08 06:21:14,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:21:14,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677292293] [2022-04-08 06:21:14,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677292293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:14,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:14,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:21:14,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:21:14,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [669410891] [2022-04-08 06:21:14,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [669410891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:14,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:14,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:21:14,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909175624] [2022-04-08 06:21:14,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:21:14,206 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-08 06:21:14,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:21:14,206 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-08 06:21:14,218 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-08 06:21:14,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:21:14,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:14,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:21:14,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:21:14,219 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-08 06:21:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:14,290 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-08 06:21:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:21:14,290 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-08 06:21:14,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:21:14,290 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-08 06:21:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-08 06:21:14,292 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-08 06:21:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-08 06:21:14,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-08 06:21:14,335 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-08 06:21:14,336 INFO L225 Difference]: With dead ends: 52 [2022-04-08 06:21:14,336 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 06:21:14,336 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-08 06:21:14,337 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-08 06:21:14,337 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-08 06:21:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 06:21:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 06:21:14,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:21:14,353 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-08 06:21:14,354 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-08 06:21:14,355 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-08 06:21:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:14,356 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-08 06:21:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-08 06:21:14,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:14,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:14,360 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-08 06:21:14,360 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-08 06:21:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:14,363 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-08 06:21:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-08 06:21:14,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:14,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:14,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:21:14,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:21:14,367 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-08 06:21:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-08 06:21:14,368 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-08 06:21:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:21:14,368 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-08 06:21:14,369 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-08 06:21:14,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 47 transitions. [2022-04-08 06:21:14,403 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-08 06:21:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-08 06:21:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 06:21:14,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:21:14,404 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-08 06:21:14,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 06:21:14,622 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-08 06:21:14,623 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:21:14,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:21:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-08 06:21:14,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:14,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1019623445] [2022-04-08 06:21:14,624 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:21:14,624 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 2 times [2022-04-08 06:21:14,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:21:14,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731912072] [2022-04-08 06:21:14,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:21:14,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:21:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:14,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:21:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:14,684 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-08 06:21:14,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 06:21:14,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-08 06:21:14,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 06:21:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:14,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-08 06:21:14,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-08 06:21:14,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 06:21:14,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-08 06:21:14,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-08 06:21:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:14,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-08 06:21:14,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-08 06:21:14,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 06:21:14,694 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-08 06:21:14,695 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-08 06:21:14,695 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-08 06:21:14,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 06:21:14,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-08 06:21:14,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret8 := main(); {912#true} is VALID [2022-04-08 06:21:14,696 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-08 06:21:14,696 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-08 06:21:14,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-08 06:21:14,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-08 06:21:14,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 06:21:14,696 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-08 06:21:14,697 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-08 06:21:14,698 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-08 06:21:14,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} assume !!(#t~post6 < 50);havoc #t~post6; {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-08 06:21:14,698 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-08 06:21:14,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-08 06:21:14,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-08 06:21:14,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 06:21:14,699 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-08 06:21:14,700 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-08 06:21:14,700 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-08 06:21:14,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {927#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {913#false} is VALID [2022-04-08 06:21:14,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-08 06:21:14,701 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-08 06:21:14,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:21:14,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731912072] [2022-04-08 06:21:14,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731912072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:14,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:14,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:21:14,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:21:14,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1019623445] [2022-04-08 06:21:14,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1019623445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:14,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:14,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:21:14,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447431128] [2022-04-08 06:21:14,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:21:14,702 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-08 06:21:14,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:21:14,703 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-08 06:21:14,716 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-08 06:21:14,716 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:21:14,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:14,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:21:14,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:21:14,717 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-08 06:21:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:15,055 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 06:21:15,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:21:15,055 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-08 06:21:15,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:21:15,055 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-08 06:21:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-08 06:21:15,057 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-08 06:21:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-08 06:21:15,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-08 06:21:15,107 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-08 06:21:15,109 INFO L225 Difference]: With dead ends: 52 [2022-04-08 06:21:15,109 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 06:21:15,109 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-08 06:21:15,110 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-08 06:21:15,110 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-08 06:21:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 06:21:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-08 06:21:15,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:21:15,120 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-08 06:21:15,121 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-08 06:21:15,121 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-08 06:21:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:15,122 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 06:21:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 06:21:15,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:15,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:15,123 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-08 06:21:15,123 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-08 06:21:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:15,125 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 06:21:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 06:21:15,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:15,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:15,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:21:15,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:21:15,125 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-08 06:21:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-08 06:21:15,126 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-08 06:21:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:21:15,127 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-08 06:21:15,127 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-08 06:21:15,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-08 06:21:15,162 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-08 06:21:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-08 06:21:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 06:21:15,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:21:15,163 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-08 06:21:15,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 06:21:15,163 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:21:15,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:21:15,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-08 06:21:15,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:15,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [330265022] [2022-04-08 06:21:15,164 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:21:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 2 times [2022-04-08 06:21:15,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:21:15,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995351561] [2022-04-08 06:21:15,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:21:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:21:15,184 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:21:15,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2019507161] [2022-04-08 06:21:15,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:21:15,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:21:15,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:21:15,185 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-08 06:21:15,186 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-08 06:21:15,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:21:15,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:21:15,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 06:21:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:15,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:21:15,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {1227#true} call ULTIMATE.init(); {1227#true} is VALID [2022-04-08 06:21:15,346 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-08 06:21:15,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-08 06:21:15,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1227#true} #96#return; {1227#true} is VALID [2022-04-08 06:21:15,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {1227#true} call #t~ret8 := main(); {1227#true} is VALID [2022-04-08 06:21:15,346 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-08 06:21:15,347 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-08 06:21:15,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-08 06:21:15,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-08 06:21:15,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-08 06:21:15,347 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1227#true} {1227#true} #80#return; {1227#true} is VALID [2022-04-08 06:21:15,348 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-08 06:21:15,349 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-08 06:21:15,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-08 06:21:15,349 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-08 06:21:15,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-08 06:21:15,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-08 06:21:15,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-08 06:21:15,359 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-08 06:21:15,360 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-08 06:21:15,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-08 06:21:15,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-08 06:21:15,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-08 06:21:15,361 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-08 06:21:15,361 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-08 06:21:15,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:21:15,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {1309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1228#false} is VALID [2022-04-08 06:21:15,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {1228#false} assume !false; {1228#false} is VALID [2022-04-08 06:21:15,362 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-08 06:21:15,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:21:15,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:21:15,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995351561] [2022-04-08 06:21:15,363 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:21:15,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019507161] [2022-04-08 06:21:15,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019507161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:15,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:15,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:21:15,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:21:15,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [330265022] [2022-04-08 06:21:15,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [330265022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:15,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:15,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:21:15,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026529393] [2022-04-08 06:21:15,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:21:15,364 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-08 06:21:15,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:21:15,364 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-08 06:21:15,384 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-08 06:21:15,384 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:21:15,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:15,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:21:15,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:21:15,385 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-08 06:21:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:15,576 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-08 06:21:15,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:21:15,576 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-08 06:21:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:21:15,578 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-08 06:21:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-04-08 06:21:15,580 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-08 06:21:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-04-08 06:21:15,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 87 transitions. [2022-04-08 06:21:15,643 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-08 06:21:15,644 INFO L225 Difference]: With dead ends: 71 [2022-04-08 06:21:15,644 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 06:21:15,645 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-08 06:21:15,645 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-08 06:21:15,646 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-08 06:21:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 06:21:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-08 06:21:15,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:21:15,663 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-08 06:21:15,663 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-08 06:21:15,664 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-08 06:21:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:15,667 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-08 06:21:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-08 06:21:15,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:15,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:15,668 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-08 06:21:15,668 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-08 06:21:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:15,670 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-08 06:21:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-08 06:21:15,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:15,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:15,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:21:15,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:21:15,671 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-08 06:21:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-08 06:21:15,673 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 28 [2022-04-08 06:21:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:21:15,674 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-08 06:21:15,674 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-08 06:21:15,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-08 06:21:15,735 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-08 06:21:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-08 06:21:15,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 06:21:15,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:21:15,736 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-08 06:21:15,755 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-08 06:21:15,947 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-08 06:21:15,947 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:21:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:21:15,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-08 06:21:15,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:15,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12050178] [2022-04-08 06:21:15,948 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:21:15,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 2 times [2022-04-08 06:21:15,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:21:15,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740662248] [2022-04-08 06:21:15,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:21:15,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:21:15,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:21:15,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232351092] [2022-04-08 06:21:15,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:21:15,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:21:15,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:21:15,960 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-08 06:21:15,961 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-08 06:21:15,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:21:15,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:21:15,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 06:21:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:16,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:21:16,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {1683#true} call ULTIMATE.init(); {1683#true} is VALID [2022-04-08 06:21:16,148 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-08 06:21:16,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {1691#(<= ~counter~0 0)} assume true; {1691#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:16,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1691#(<= ~counter~0 0)} {1683#true} #96#return; {1691#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:16,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {1691#(<= ~counter~0 0)} call #t~ret8 := main(); {1691#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:16,149 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-08 06:21:16,150 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-08 06:21:16,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {1691#(<= ~counter~0 0)} ~cond := #in~cond; {1691#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:16,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {1691#(<= ~counter~0 0)} assume !(0 == ~cond); {1691#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:16,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#(<= ~counter~0 0)} assume true; {1691#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:16,151 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1691#(<= ~counter~0 0)} {1691#(<= ~counter~0 0)} #80#return; {1691#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:16,151 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-08 06:21:16,152 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-08 06:21:16,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {1725#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,152 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-08 06:21:16,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {1725#(<= ~counter~0 1)} ~cond := #in~cond; {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {1725#(<= ~counter~0 1)} assume !(0 == ~cond); {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {1725#(<= ~counter~0 1)} assume true; {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,154 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1725#(<= ~counter~0 1)} {1725#(<= ~counter~0 1)} #82#return; {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,154 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-08 06:21:16,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {1725#(<= ~counter~0 1)} ~cond := #in~cond; {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {1725#(<= ~counter~0 1)} assume !(0 == ~cond); {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {1725#(<= ~counter~0 1)} assume true; {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,155 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1725#(<= ~counter~0 1)} {1725#(<= ~counter~0 1)} #84#return; {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,156 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-08 06:21:16,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {1725#(<= ~counter~0 1)} ~cond := #in~cond; {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {1725#(<= ~counter~0 1)} assume !(0 == ~cond); {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {1725#(<= ~counter~0 1)} assume true; {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,157 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1725#(<= ~counter~0 1)} {1725#(<= ~counter~0 1)} #86#return; {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {1725#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1725#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:16,158 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-08 06:21:16,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {1780#(<= |main_#t~post7| 1)} assume !(#t~post7 < 50);havoc #t~post7; {1684#false} is VALID [2022-04-08 06:21:16,158 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-08 06:21:16,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {1684#false} ~cond := #in~cond; {1684#false} is VALID [2022-04-08 06:21:16,158 INFO L290 TraceCheckUtils]: 34: Hoare triple {1684#false} assume 0 == ~cond; {1684#false} is VALID [2022-04-08 06:21:16,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {1684#false} assume !false; {1684#false} is VALID [2022-04-08 06:21:16,159 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-08 06:21:16,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:21:16,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:21:16,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740662248] [2022-04-08 06:21:16,159 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:21:16,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232351092] [2022-04-08 06:21:16,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232351092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:16,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:16,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:21:16,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:21:16,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12050178] [2022-04-08 06:21:16,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12050178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:16,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:16,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:21:16,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343309641] [2022-04-08 06:21:16,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:21:16,160 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-08 06:21:16,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:21:16,161 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-08 06:21:16,178 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-08 06:21:16,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:21:16,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:16,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:21:16,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:21:16,179 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-08 06:21:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:16,293 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-04-08 06:21:16,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:21:16,293 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-08 06:21:16,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:21:16,293 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-08 06:21:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 06:21:16,294 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-08 06:21:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 06:21:16,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 06:21:16,337 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-08 06:21:16,338 INFO L225 Difference]: With dead ends: 76 [2022-04-08 06:21:16,338 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 06:21:16,338 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-08 06:21:16,339 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-08 06:21:16,339 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-08 06:21:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 06:21:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-08 06:21:16,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:21:16,365 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-08 06:21:16,365 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-08 06:21:16,365 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-08 06:21:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:16,367 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-08 06:21:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-08 06:21:16,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:16,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:16,367 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-08 06:21:16,367 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-08 06:21:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:16,369 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-08 06:21:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-08 06:21:16,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:16,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:16,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:21:16,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:21:16,370 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-08 06:21:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-04-08 06:21:16,371 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 36 [2022-04-08 06:21:16,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:21:16,371 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-04-08 06:21:16,371 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-08 06:21:16,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 78 transitions. [2022-04-08 06:21:16,434 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-08 06:21:16,434 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-04-08 06:21:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 06:21:16,434 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:21:16,434 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-08 06:21:16,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 06:21:16,643 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-08 06:21:16,644 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:21:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:21:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-08 06:21:16,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:16,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1481617220] [2022-04-08 06:21:16,644 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:21:16,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 2 times [2022-04-08 06:21:16,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:21:16,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138188986] [2022-04-08 06:21:16,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:21:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:21:16,662 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:21:16,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165383518] [2022-04-08 06:21:16,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:21:16,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:21:16,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:21:16,664 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-08 06:21:16,664 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-08 06:21:16,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:21:16,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:21:16,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 06:21:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:16,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:21:16,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {2221#true} call ULTIMATE.init(); {2221#true} is VALID [2022-04-08 06:21:16,825 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-08 06:21:16,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-08 06:21:16,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2221#true} {2221#true} #96#return; {2221#true} is VALID [2022-04-08 06:21:16,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {2221#true} call #t~ret8 := main(); {2221#true} is VALID [2022-04-08 06:21:16,826 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-08 06:21:16,826 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-08 06:21:16,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {2221#true} ~cond := #in~cond; {2221#true} is VALID [2022-04-08 06:21:16,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {2221#true} assume !(0 == ~cond); {2221#true} is VALID [2022-04-08 06:21:16,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-08 06:21:16,827 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2221#true} {2221#true} #80#return; {2221#true} is VALID [2022-04-08 06:21:16,827 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-08 06:21:16,828 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-08 06:21:16,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:21:16,828 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-08 06:21:16,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {2221#true} ~cond := #in~cond; {2221#true} is VALID [2022-04-08 06:21:16,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {2221#true} assume !(0 == ~cond); {2221#true} is VALID [2022-04-08 06:21:16,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-08 06:21:16,831 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-08 06:21:16,831 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-08 06:21:16,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {2221#true} ~cond := #in~cond; {2221#true} is VALID [2022-04-08 06:21:16,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {2221#true} assume !(0 == ~cond); {2221#true} is VALID [2022-04-08 06:21:16,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-08 06:21:16,832 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-08 06:21:16,832 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-08 06:21:16,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {2221#true} ~cond := #in~cond; {2221#true} is VALID [2022-04-08 06:21:16,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {2221#true} assume !(0 == ~cond); {2221#true} is VALID [2022-04-08 06:21:16,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-08 06:21:16,833 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-08 06:21:16,833 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-08 06:21:16,836 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-08 06:21:16,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:21:16,837 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-08 06:21:16,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {2323#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2327#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:21:16,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {2327#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2222#false} is VALID [2022-04-08 06:21:16,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {2222#false} assume !false; {2222#false} is VALID [2022-04-08 06:21:16,838 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-08 06:21:16,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:21:16,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:21:16,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138188986] [2022-04-08 06:21:16,838 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:21:16,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165383518] [2022-04-08 06:21:16,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165383518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:16,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:16,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:21:16,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:21:16,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1481617220] [2022-04-08 06:21:16,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1481617220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:16,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:16,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:21:16,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616435690] [2022-04-08 06:21:16,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:21:16,840 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-08 06:21:16,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:21:16,840 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-08 06:21:16,861 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-08 06:21:16,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:21:16,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:16,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:21:16,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:21:16,862 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-08 06:21:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:17,057 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-04-08 06:21:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:21:17,057 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-08 06:21:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:21:17,058 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-08 06:21:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-08 06:21:17,059 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-08 06:21:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-08 06:21:17,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-08 06:21:17,103 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-08 06:21:17,104 INFO L225 Difference]: With dead ends: 82 [2022-04-08 06:21:17,104 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 06:21:17,104 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-08 06:21:17,105 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-08 06:21:17,105 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-08 06:21:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 06:21:17,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-08 06:21:17,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:21:17,144 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-08 06:21:17,144 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-08 06:21:17,144 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-08 06:21:17,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:17,146 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-08 06:21:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-08 06:21:17,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:17,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:17,147 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-08 06:21:17,147 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-08 06:21:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:17,148 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-08 06:21:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-08 06:21:17,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:17,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:17,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:21:17,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:21:17,149 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-08 06:21:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-04-08 06:21:17,151 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 36 [2022-04-08 06:21:17,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:21:17,151 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-04-08 06:21:17,151 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-08 06:21:17,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 82 transitions. [2022-04-08 06:21:17,216 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-08 06:21:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-04-08 06:21:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 06:21:17,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:21:17,217 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-08 06:21:17,235 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-08 06:21:17,431 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-08 06:21:17,431 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:21:17,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:21:17,432 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 1 times [2022-04-08 06:21:17,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:17,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [162192318] [2022-04-08 06:21:24,368 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:21:24,368 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:21:24,368 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:21:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 2 times [2022-04-08 06:21:24,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:21:24,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063209889] [2022-04-08 06:21:24,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:21:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:21:24,378 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:21:24,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1665828272] [2022-04-08 06:21:24,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:21:24,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:21:24,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:21:24,379 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-08 06:21:24,385 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-08 06:21:24,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:21:24,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:21:24,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 06:21:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:24,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:21:24,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {2777#true} call ULTIMATE.init(); {2777#true} is VALID [2022-04-08 06:21:24,624 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-08 06:21:24,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {2785#(<= ~counter~0 0)} assume true; {2785#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:24,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2785#(<= ~counter~0 0)} {2777#true} #96#return; {2785#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:24,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {2785#(<= ~counter~0 0)} call #t~ret8 := main(); {2785#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:24,626 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-08 06:21:24,626 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-08 06:21:24,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {2785#(<= ~counter~0 0)} ~cond := #in~cond; {2785#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:24,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {2785#(<= ~counter~0 0)} assume !(0 == ~cond); {2785#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:24,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {2785#(<= ~counter~0 0)} assume true; {2785#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:24,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2785#(<= ~counter~0 0)} {2785#(<= ~counter~0 0)} #80#return; {2785#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:24,627 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-08 06:21:24,628 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-08 06:21:24,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {2819#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2819#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:24,629 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-08 06:21:24,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {2819#(<= ~counter~0 1)} ~cond := #in~cond; {2819#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:24,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {2819#(<= ~counter~0 1)} assume !(0 == ~cond); {2819#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:24,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {2819#(<= ~counter~0 1)} assume true; {2819#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:24,630 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2819#(<= ~counter~0 1)} {2819#(<= ~counter~0 1)} #82#return; {2819#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:24,630 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-08 06:21:24,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {2819#(<= ~counter~0 1)} ~cond := #in~cond; {2819#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:24,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {2819#(<= ~counter~0 1)} assume !(0 == ~cond); {2819#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:24,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {2819#(<= ~counter~0 1)} assume true; {2819#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:24,632 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2819#(<= ~counter~0 1)} {2819#(<= ~counter~0 1)} #84#return; {2819#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:24,632 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-08 06:21:24,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {2819#(<= ~counter~0 1)} ~cond := #in~cond; {2819#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:24,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {2819#(<= ~counter~0 1)} assume !(0 == ~cond); {2819#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:24,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {2819#(<= ~counter~0 1)} assume true; {2819#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:24,633 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2819#(<= ~counter~0 1)} {2819#(<= ~counter~0 1)} #86#return; {2819#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:24,634 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-08 06:21:24,634 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-08 06:21:24,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {2874#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {2778#false} is VALID [2022-04-08 06:21:24,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {2778#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2778#false} is VALID [2022-04-08 06:21:24,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {2778#false} assume !(#t~post7 < 50);havoc #t~post7; {2778#false} is VALID [2022-04-08 06:21:24,635 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-08 06:21:24,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {2778#false} ~cond := #in~cond; {2778#false} is VALID [2022-04-08 06:21:24,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {2778#false} assume !(0 == ~cond); {2778#false} is VALID [2022-04-08 06:21:24,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {2778#false} assume true; {2778#false} is VALID [2022-04-08 06:21:24,635 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2778#false} {2778#false} #92#return; {2778#false} is VALID [2022-04-08 06:21:24,635 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-08 06:21:24,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {2778#false} ~cond := #in~cond; {2778#false} is VALID [2022-04-08 06:21:24,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {2778#false} assume 0 == ~cond; {2778#false} is VALID [2022-04-08 06:21:24,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {2778#false} assume !false; {2778#false} is VALID [2022-04-08 06:21:24,636 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-08 06:21:24,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:21:24,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {2778#false} assume !false; {2778#false} is VALID [2022-04-08 06:21:24,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {2778#false} assume 0 == ~cond; {2778#false} is VALID [2022-04-08 06:21:24,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {2778#false} ~cond := #in~cond; {2778#false} is VALID [2022-04-08 06:21:24,824 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-08 06:21:24,824 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2777#true} {2778#false} #92#return; {2778#false} is VALID [2022-04-08 06:21:24,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-08 06:21:24,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-08 06:21:24,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-08 06:21:24,824 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-08 06:21:24,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {2778#false} assume !(#t~post7 < 50);havoc #t~post7; {2778#false} is VALID [2022-04-08 06:21:24,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {2778#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2778#false} is VALID [2022-04-08 06:21:24,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {2944#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {2778#false} is VALID [2022-04-08 06:21:24,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {2948#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2944#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:21:24,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {2948#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2948#(< ~counter~0 50)} is VALID [2022-04-08 06:21:24,826 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2777#true} {2948#(< ~counter~0 50)} #86#return; {2948#(< ~counter~0 50)} is VALID [2022-04-08 06:21:24,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-08 06:21:24,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-08 06:21:24,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-08 06:21:24,826 INFO L272 TraceCheckUtils]: 24: Hoare triple {2948#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2777#true} is VALID [2022-04-08 06:21:24,827 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2777#true} {2948#(< ~counter~0 50)} #84#return; {2948#(< ~counter~0 50)} is VALID [2022-04-08 06:21:24,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-08 06:21:24,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-08 06:21:24,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-08 06:21:24,827 INFO L272 TraceCheckUtils]: 19: Hoare triple {2948#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2777#true} is VALID [2022-04-08 06:21:24,828 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2777#true} {2948#(< ~counter~0 50)} #82#return; {2948#(< ~counter~0 50)} is VALID [2022-04-08 06:21:24,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-08 06:21:24,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-08 06:21:24,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-08 06:21:24,828 INFO L272 TraceCheckUtils]: 14: Hoare triple {2948#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2777#true} is VALID [2022-04-08 06:21:24,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {2948#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {2948#(< ~counter~0 50)} is VALID [2022-04-08 06:21:24,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {3003#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2948#(< ~counter~0 50)} is VALID [2022-04-08 06:21:24,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {3003#(< ~counter~0 49)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3003#(< ~counter~0 49)} is VALID [2022-04-08 06:21:24,830 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2777#true} {3003#(< ~counter~0 49)} #80#return; {3003#(< ~counter~0 49)} is VALID [2022-04-08 06:21:24,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-08 06:21:24,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-08 06:21:24,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-08 06:21:24,830 INFO L272 TraceCheckUtils]: 6: Hoare triple {3003#(< ~counter~0 49)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2777#true} is VALID [2022-04-08 06:21:24,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {3003#(< ~counter~0 49)} 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 49)} is VALID [2022-04-08 06:21:24,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {3003#(< ~counter~0 49)} call #t~ret8 := main(); {3003#(< ~counter~0 49)} is VALID [2022-04-08 06:21:24,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3003#(< ~counter~0 49)} {2777#true} #96#return; {3003#(< ~counter~0 49)} is VALID [2022-04-08 06:21:24,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {3003#(< ~counter~0 49)} assume true; {3003#(< ~counter~0 49)} is VALID [2022-04-08 06:21:24,832 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 49)} is VALID [2022-04-08 06:21:24,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {2777#true} call ULTIMATE.init(); {2777#true} is VALID [2022-04-08 06:21:24,832 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-08 06:21:24,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:21:24,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063209889] [2022-04-08 06:21:24,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:21:24,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665828272] [2022-04-08 06:21:24,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665828272] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:21:24,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:21:24,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 06:21:24,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:21:24,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [162192318] [2022-04-08 06:21:24,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [162192318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:24,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:24,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:21:24,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180748429] [2022-04-08 06:21:24,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:21:24,834 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-08 06:21:24,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:21:24,834 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-08 06:21:24,859 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-08 06:21:24,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:21:24,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:24,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:21:24,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 06:21:24,860 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-08 06:21:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:24,989 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2022-04-08 06:21:24,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 06:21:24,989 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-08 06:21:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:21:24,989 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-08 06:21:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-04-08 06:21:24,990 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-08 06:21:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-04-08 06:21:24,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2022-04-08 06:21:25,051 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-08 06:21:25,052 INFO L225 Difference]: With dead ends: 96 [2022-04-08 06:21:25,052 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 06:21:25,052 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-08 06:21:25,053 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-08 06:21:25,053 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-08 06:21:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 06:21:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-08 06:21:25,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:21:25,108 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-08 06:21:25,113 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-08 06:21:25,116 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-08 06:21:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:25,118 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-08 06:21:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-08 06:21:25,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:25,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:25,119 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-08 06:21:25,119 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-08 06:21:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:25,121 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-08 06:21:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-08 06:21:25,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:25,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:25,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:21:25,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:21:25,121 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-08 06:21:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2022-04-08 06:21:25,123 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 43 [2022-04-08 06:21:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:21:25,123 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2022-04-08 06:21:25,123 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-08 06:21:25,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 84 transitions. [2022-04-08 06:21:25,209 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-08 06:21:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-08 06:21:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 06:21:25,209 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:21:25,209 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-08 06:21:25,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 06:21:25,419 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-08 06:21:25,419 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:21:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:21:25,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-08 06:21:25,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:25,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1421860453] [2022-04-08 06:21:33,579 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:21:33,579 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:21:33,579 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:21:33,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 2 times [2022-04-08 06:21:33,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:21:33,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006654263] [2022-04-08 06:21:33,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:21:33,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:21:33,587 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:21:33,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282788629] [2022-04-08 06:21:33,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:21:33,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:21:33,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:21:33,604 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-08 06:21:33,604 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-08 06:21:33,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:21:33,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:21:33,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 06:21:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:33,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:21:34,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {3520#true} call ULTIMATE.init(); {3520#true} is VALID [2022-04-08 06:21:34,318 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-08 06:21:34,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-08 06:21:34,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3520#true} {3520#true} #96#return; {3520#true} is VALID [2022-04-08 06:21:34,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {3520#true} call #t~ret8 := main(); {3520#true} is VALID [2022-04-08 06:21:34,318 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-08 06:21:34,318 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-08 06:21:34,319 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-08 06:21:34,319 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-08 06:21:34,319 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-08 06:21:34,320 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-08 06:21:34,320 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-08 06:21:34,321 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-08 06:21:34,321 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 < 50);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-08 06:21:34,321 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-08 06:21:34,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-08 06:21:34,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-08 06:21:34,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-08 06:21:34,323 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-08 06:21:34,323 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-08 06:21:34,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-08 06:21:34,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-08 06:21:34,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-08 06:21:34,324 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-08 06:21:34,324 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-08 06:21:34,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-08 06:21:34,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-08 06:21:34,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-08 06:21:34,324 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-08 06:21:34,325 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-08 06:21:34,326 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-08 06:21:34,326 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 < 50);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-08 06:21:34,326 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-08 06:21:34,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-08 06:21:34,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-08 06:21:34,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-08 06:21:34,327 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-08 06:21:34,327 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-08 06:21:34,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-08 06:21:34,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-08 06:21:34,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-08 06:21:34,328 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-08 06:21:34,328 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-08 06:21:34,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {3656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:21:34,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {3660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3521#false} is VALID [2022-04-08 06:21:34,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {3521#false} assume !false; {3521#false} is VALID [2022-04-08 06:21:34,329 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-08 06:21:34,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:21:34,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {3521#false} assume !false; {3521#false} is VALID [2022-04-08 06:21:34,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {3660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3521#false} is VALID [2022-04-08 06:21:34,613 INFO L290 TraceCheckUtils]: 43: Hoare triple {3656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:21:34,613 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-08 06:21:34,614 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-08 06:21:34,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-08 06:21:34,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-08 06:21:34,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-08 06:21:34,614 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-08 06:21:34,614 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-08 06:21:34,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-08 06:21:34,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-08 06:21:34,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-08 06:21:34,615 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-08 06:21:34,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 50);havoc #t~post6; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-08 06:21:34,615 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-08 06:21:34,616 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-08 06:21:34,617 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-08 06:21:34,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-08 06:21:34,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-08 06:21:34,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-08 06:21:34,617 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-08 06:21:34,617 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-08 06:21:34,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-08 06:21:34,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-08 06:21:34,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-08 06:21:34,618 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-08 06:21:34,618 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-08 06:21:34,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-08 06:21:34,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-08 06:21:34,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-08 06:21:34,618 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-08 06:21:34,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 50);havoc #t~post6; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-08 06:21:34,619 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-08 06:21:34,619 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-08 06:21:34,619 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3520#true} {3520#true} #80#return; {3520#true} is VALID [2022-04-08 06:21:34,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-08 06:21:34,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-08 06:21:34,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-08 06:21:34,623 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-08 06:21:34,623 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-08 06:21:34,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {3520#true} call #t~ret8 := main(); {3520#true} is VALID [2022-04-08 06:21:34,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3520#true} {3520#true} #96#return; {3520#true} is VALID [2022-04-08 06:21:34,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-08 06:21:34,625 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-08 06:21:34,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {3520#true} call ULTIMATE.init(); {3520#true} is VALID [2022-04-08 06:21:34,626 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-08 06:21:34,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:21:34,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006654263] [2022-04-08 06:21:34,626 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:21:34,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282788629] [2022-04-08 06:21:34,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282788629] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 06:21:34,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 06:21:34,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-08 06:21:34,627 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:21:34,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1421860453] [2022-04-08 06:21:34,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1421860453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:34,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:34,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:21:34,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58276116] [2022-04-08 06:21:34,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:21:34,628 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-08 06:21:34,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:21:34,628 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-08 06:21:34,644 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-08 06:21:34,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:21:34,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:34,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:21:34,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:21:34,645 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-08 06:21:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:34,924 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2022-04-08 06:21:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:21:34,925 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-08 06:21:34,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:21:34,925 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-08 06:21:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-08 06:21:34,926 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-08 06:21:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-08 06:21:34,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-08 06:21:34,970 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-08 06:21:34,972 INFO L225 Difference]: With dead ends: 84 [2022-04-08 06:21:34,973 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 06:21:34,973 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-08 06:21:34,973 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-08 06:21:34,973 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-08 06:21:34,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 06:21:35,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-04-08 06:21:35,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:21:35,016 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-08 06:21:35,016 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-08 06:21:35,016 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-08 06:21:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:35,019 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-08 06:21:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-08 06:21:35,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:35,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:35,019 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-08 06:21:35,019 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-08 06:21:35,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:35,021 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-08 06:21:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-08 06:21:35,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:35,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:35,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:21:35,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:21:35,021 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-08 06:21:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2022-04-08 06:21:35,023 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 46 [2022-04-08 06:21:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:21:35,023 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2022-04-08 06:21:35,023 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-08 06:21:35,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 94 transitions. [2022-04-08 06:21:35,116 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-08 06:21:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-08 06:21:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 06:21:35,116 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:21:35,117 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-08 06:21:35,133 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-08 06:21:35,327 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-08 06:21:35,327 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:21:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:21:35,328 INFO L85 PathProgramCache]: Analyzing trace with hash 967982746, now seen corresponding path program 1 times [2022-04-08 06:21:35,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:35,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1807171918] [2022-04-08 06:21:42,027 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:21:42,027 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:21:42,027 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:21:42,027 INFO L85 PathProgramCache]: Analyzing trace with hash 967982746, now seen corresponding path program 2 times [2022-04-08 06:21:42,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:21:42,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840207079] [2022-04-08 06:21:42,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:21:42,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:21:42,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:21:42,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947514190] [2022-04-08 06:21:42,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:21:42,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:21:42,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:21:42,060 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-08 06:21:42,060 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-08 06:21:42,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:21:42,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:21:42,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 06:21:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:42,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:21:42,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {4297#true} call ULTIMATE.init(); {4297#true} is VALID [2022-04-08 06:21:42,365 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-08 06:21:42,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {4305#(<= ~counter~0 0)} assume true; {4305#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:42,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4305#(<= ~counter~0 0)} {4297#true} #96#return; {4305#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:42,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {4305#(<= ~counter~0 0)} call #t~ret8 := main(); {4305#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:42,367 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-08 06:21:42,368 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-08 06:21:42,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {4305#(<= ~counter~0 0)} ~cond := #in~cond; {4305#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:42,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {4305#(<= ~counter~0 0)} assume !(0 == ~cond); {4305#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:42,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {4305#(<= ~counter~0 0)} assume true; {4305#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:42,369 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4305#(<= ~counter~0 0)} {4305#(<= ~counter~0 0)} #80#return; {4305#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:42,369 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-08 06:21:42,370 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-08 06:21:42,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {4339#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {4339#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:42,371 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-08 06:21:42,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {4339#(<= ~counter~0 1)} ~cond := #in~cond; {4339#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:42,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {4339#(<= ~counter~0 1)} assume !(0 == ~cond); {4339#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:42,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {4339#(<= ~counter~0 1)} assume true; {4339#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:42,374 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4339#(<= ~counter~0 1)} {4339#(<= ~counter~0 1)} #82#return; {4339#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:42,375 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-08 06:21:42,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {4339#(<= ~counter~0 1)} ~cond := #in~cond; {4339#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:42,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {4339#(<= ~counter~0 1)} assume !(0 == ~cond); {4339#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:42,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {4339#(<= ~counter~0 1)} assume true; {4339#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:42,376 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4339#(<= ~counter~0 1)} {4339#(<= ~counter~0 1)} #84#return; {4339#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:42,376 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-08 06:21:42,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {4339#(<= ~counter~0 1)} ~cond := #in~cond; {4339#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:42,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {4339#(<= ~counter~0 1)} assume !(0 == ~cond); {4339#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:42,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {4339#(<= ~counter~0 1)} assume true; {4339#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:42,378 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4339#(<= ~counter~0 1)} {4339#(<= ~counter~0 1)} #86#return; {4339#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:42,378 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-08 06:21:42,378 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-08 06:21:42,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {4394#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,379 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-08 06:21:42,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {4394#(<= ~counter~0 2)} ~cond := #in~cond; {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {4394#(<= ~counter~0 2)} assume !(0 == ~cond); {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {4394#(<= ~counter~0 2)} assume true; {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,380 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4394#(<= ~counter~0 2)} {4394#(<= ~counter~0 2)} #82#return; {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,381 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-08 06:21:42,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {4394#(<= ~counter~0 2)} ~cond := #in~cond; {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {4394#(<= ~counter~0 2)} assume !(0 == ~cond); {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {4394#(<= ~counter~0 2)} assume true; {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,382 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4394#(<= ~counter~0 2)} {4394#(<= ~counter~0 2)} #84#return; {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,382 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-08 06:21:42,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {4394#(<= ~counter~0 2)} ~cond := #in~cond; {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,383 INFO L290 TraceCheckUtils]: 44: Hoare triple {4394#(<= ~counter~0 2)} assume !(0 == ~cond); {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,383 INFO L290 TraceCheckUtils]: 45: Hoare triple {4394#(<= ~counter~0 2)} assume true; {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,383 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4394#(<= ~counter~0 2)} {4394#(<= ~counter~0 2)} #86#return; {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,384 INFO L290 TraceCheckUtils]: 47: Hoare triple {4394#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {4394#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:42,384 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-08 06:21:42,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {4449#(<= |main_#t~post7| 2)} assume !(#t~post7 < 50);havoc #t~post7; {4298#false} is VALID [2022-04-08 06:21:42,384 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-08 06:21:42,385 INFO L290 TraceCheckUtils]: 51: Hoare triple {4298#false} ~cond := #in~cond; {4298#false} is VALID [2022-04-08 06:21:42,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {4298#false} assume !(0 == ~cond); {4298#false} is VALID [2022-04-08 06:21:42,385 INFO L290 TraceCheckUtils]: 53: Hoare triple {4298#false} assume true; {4298#false} is VALID [2022-04-08 06:21:42,385 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4298#false} {4298#false} #92#return; {4298#false} is VALID [2022-04-08 06:21:42,385 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-08 06:21:42,385 INFO L290 TraceCheckUtils]: 56: Hoare triple {4298#false} ~cond := #in~cond; {4298#false} is VALID [2022-04-08 06:21:42,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {4298#false} assume 0 == ~cond; {4298#false} is VALID [2022-04-08 06:21:42,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2022-04-08 06:21:42,385 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-08 06:21:42,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:21:42,607 INFO L290 TraceCheckUtils]: 58: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2022-04-08 06:21:42,607 INFO L290 TraceCheckUtils]: 57: Hoare triple {4298#false} assume 0 == ~cond; {4298#false} is VALID [2022-04-08 06:21:42,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {4298#false} ~cond := #in~cond; {4298#false} is VALID [2022-04-08 06:21:42,607 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-08 06:21:42,607 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4297#true} {4298#false} #92#return; {4298#false} is VALID [2022-04-08 06:21:42,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-08 06:21:42,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-08 06:21:42,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-08 06:21:42,607 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-08 06:21:42,608 INFO L290 TraceCheckUtils]: 49: Hoare triple {4507#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {4298#false} is VALID [2022-04-08 06:21:42,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {4511#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4507#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:21:42,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {4511#(< ~counter~0 50)} assume !(~r~0 >= ~d~0); {4511#(< ~counter~0 50)} is VALID [2022-04-08 06:21:42,609 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4297#true} {4511#(< ~counter~0 50)} #86#return; {4511#(< ~counter~0 50)} is VALID [2022-04-08 06:21:42,609 INFO L290 TraceCheckUtils]: 45: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-08 06:21:42,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-08 06:21:42,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-08 06:21:42,609 INFO L272 TraceCheckUtils]: 42: Hoare triple {4511#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4297#true} is VALID [2022-04-08 06:21:42,610 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4297#true} {4511#(< ~counter~0 50)} #84#return; {4511#(< ~counter~0 50)} is VALID [2022-04-08 06:21:42,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-08 06:21:42,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-08 06:21:42,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-08 06:21:42,610 INFO L272 TraceCheckUtils]: 37: Hoare triple {4511#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4297#true} is VALID [2022-04-08 06:21:42,610 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4297#true} {4511#(< ~counter~0 50)} #82#return; {4511#(< ~counter~0 50)} is VALID [2022-04-08 06:21:42,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-08 06:21:42,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-08 06:21:42,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-08 06:21:42,611 INFO L272 TraceCheckUtils]: 32: Hoare triple {4511#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4297#true} is VALID [2022-04-08 06:21:42,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {4511#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {4511#(< ~counter~0 50)} is VALID [2022-04-08 06:21:42,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {4566#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4511#(< ~counter~0 50)} is VALID [2022-04-08 06:21:42,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {4566#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4566#(< ~counter~0 49)} is VALID [2022-04-08 06:21:42,612 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4297#true} {4566#(< ~counter~0 49)} #86#return; {4566#(< ~counter~0 49)} is VALID [2022-04-08 06:21:42,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-08 06:21:42,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-08 06:21:42,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-08 06:21:42,613 INFO L272 TraceCheckUtils]: 24: Hoare triple {4566#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4297#true} is VALID [2022-04-08 06:21:42,613 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4297#true} {4566#(< ~counter~0 49)} #84#return; {4566#(< ~counter~0 49)} is VALID [2022-04-08 06:21:42,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-08 06:21:42,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-08 06:21:42,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-08 06:21:42,613 INFO L272 TraceCheckUtils]: 19: Hoare triple {4566#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4297#true} is VALID [2022-04-08 06:21:42,614 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4297#true} {4566#(< ~counter~0 49)} #82#return; {4566#(< ~counter~0 49)} is VALID [2022-04-08 06:21:42,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-08 06:21:42,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-08 06:21:42,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-08 06:21:42,614 INFO L272 TraceCheckUtils]: 14: Hoare triple {4566#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4297#true} is VALID [2022-04-08 06:21:42,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {4566#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {4566#(< ~counter~0 49)} is VALID [2022-04-08 06:21:42,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {4621#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4566#(< ~counter~0 49)} is VALID [2022-04-08 06:21:42,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {4621#(< ~counter~0 48)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {4621#(< ~counter~0 48)} is VALID [2022-04-08 06:21:42,615 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4297#true} {4621#(< ~counter~0 48)} #80#return; {4621#(< ~counter~0 48)} is VALID [2022-04-08 06:21:42,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-08 06:21:42,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-08 06:21:42,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-08 06:21:42,616 INFO L272 TraceCheckUtils]: 6: Hoare triple {4621#(< ~counter~0 48)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4297#true} is VALID [2022-04-08 06:21:42,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {4621#(< ~counter~0 48)} 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 48)} is VALID [2022-04-08 06:21:42,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {4621#(< ~counter~0 48)} call #t~ret8 := main(); {4621#(< ~counter~0 48)} is VALID [2022-04-08 06:21:42,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4621#(< ~counter~0 48)} {4297#true} #96#return; {4621#(< ~counter~0 48)} is VALID [2022-04-08 06:21:42,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {4621#(< ~counter~0 48)} assume true; {4621#(< ~counter~0 48)} is VALID [2022-04-08 06:21:42,618 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 48)} is VALID [2022-04-08 06:21:42,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {4297#true} call ULTIMATE.init(); {4297#true} is VALID [2022-04-08 06:21:42,618 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-08 06:21:42,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:21:42,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840207079] [2022-04-08 06:21:42,618 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:21:42,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947514190] [2022-04-08 06:21:42,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947514190] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:21:42,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:21:42,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 06:21:42,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:21:42,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1807171918] [2022-04-08 06:21:42,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1807171918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:42,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:42,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:21:42,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570807647] [2022-04-08 06:21:42,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:21:42,619 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-08 06:21:42,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:21:42,620 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-08 06:21:42,652 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-08 06:21:42,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:21:42,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:42,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:21:42,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:21:42,653 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-08 06:21:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:42,829 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2022-04-08 06:21:42,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 06:21:42,829 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-08 06:21:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:21:42,830 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-08 06:21:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-08 06:21:42,831 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-08 06:21:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-08 06:21:42,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2022-04-08 06:21:42,885 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-08 06:21:42,887 INFO L225 Difference]: With dead ends: 110 [2022-04-08 06:21:42,887 INFO L226 Difference]: Without dead ends: 98 [2022-04-08 06:21:42,887 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-08 06:21:42,888 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-08 06:21:42,888 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-08 06:21:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-08 06:21:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-08 06:21:42,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:21:42,963 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-08 06:21:42,963 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-08 06:21:42,964 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-08 06:21:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:42,968 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-04-08 06:21:42,968 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2022-04-08 06:21:42,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:42,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:42,968 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-08 06:21:42,969 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-08 06:21:42,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:42,971 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-04-08 06:21:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2022-04-08 06:21:42,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:42,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:42,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:21:42,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:21:42,973 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-08 06:21:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2022-04-08 06:21:42,974 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 59 [2022-04-08 06:21:42,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:21:42,974 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2022-04-08 06:21:42,975 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-08 06:21:42,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 113 transitions. [2022-04-08 06:21:43,082 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-08 06:21:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2022-04-08 06:21:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 06:21:43,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:21:43,083 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-08 06:21:43,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 06:21:43,291 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-08 06:21:43,291 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:21:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:21:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 940283669, now seen corresponding path program 3 times [2022-04-08 06:21:43,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:43,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [14818431] [2022-04-08 06:21:51,887 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:21:51,887 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:21:51,887 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:21:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash 940283669, now seen corresponding path program 4 times [2022-04-08 06:21:51,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:21:51,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912736171] [2022-04-08 06:21:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:21:51,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:21:51,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:21:51,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112939411] [2022-04-08 06:21:51,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:21:51,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:21:51,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:21:51,898 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-08 06:21:51,899 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-08 06:21:51,935 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:21:51,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:21:51,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 06:21:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:21:51,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:21:52,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {5270#true} call ULTIMATE.init(); {5270#true} is VALID [2022-04-08 06:21:52,206 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-08 06:21:52,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {5278#(<= ~counter~0 0)} assume true; {5278#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:52,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5278#(<= ~counter~0 0)} {5270#true} #96#return; {5278#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:52,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {5278#(<= ~counter~0 0)} call #t~ret8 := main(); {5278#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:52,210 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-08 06:21:52,211 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-08 06:21:52,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {5278#(<= ~counter~0 0)} ~cond := #in~cond; {5278#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:52,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {5278#(<= ~counter~0 0)} assume !(0 == ~cond); {5278#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:52,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {5278#(<= ~counter~0 0)} assume true; {5278#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:52,212 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5278#(<= ~counter~0 0)} {5278#(<= ~counter~0 0)} #80#return; {5278#(<= ~counter~0 0)} is VALID [2022-04-08 06:21:52,212 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-08 06:21:52,213 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-08 06:21:52,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {5312#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {5312#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:52,213 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-08 06:21:52,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {5312#(<= ~counter~0 1)} ~cond := #in~cond; {5312#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:52,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {5312#(<= ~counter~0 1)} assume !(0 == ~cond); {5312#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:52,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {5312#(<= ~counter~0 1)} assume true; {5312#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:52,214 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5312#(<= ~counter~0 1)} {5312#(<= ~counter~0 1)} #82#return; {5312#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:52,215 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-08 06:21:52,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {5312#(<= ~counter~0 1)} ~cond := #in~cond; {5312#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:52,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {5312#(<= ~counter~0 1)} assume !(0 == ~cond); {5312#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:52,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {5312#(<= ~counter~0 1)} assume true; {5312#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:52,216 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5312#(<= ~counter~0 1)} {5312#(<= ~counter~0 1)} #84#return; {5312#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:52,216 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-08 06:21:52,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {5312#(<= ~counter~0 1)} ~cond := #in~cond; {5312#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:52,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {5312#(<= ~counter~0 1)} assume !(0 == ~cond); {5312#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:52,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {5312#(<= ~counter~0 1)} assume true; {5312#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:52,218 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5312#(<= ~counter~0 1)} {5312#(<= ~counter~0 1)} #86#return; {5312#(<= ~counter~0 1)} is VALID [2022-04-08 06:21:52,218 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-08 06:21:52,219 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-08 06:21:52,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {5367#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {5367#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:52,219 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-08 06:21:52,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {5367#(<= ~counter~0 2)} ~cond := #in~cond; {5367#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:52,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {5367#(<= ~counter~0 2)} assume !(0 == ~cond); {5367#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:52,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {5367#(<= ~counter~0 2)} assume true; {5367#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:52,220 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5367#(<= ~counter~0 2)} {5367#(<= ~counter~0 2)} #82#return; {5367#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:52,221 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-08 06:21:52,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {5367#(<= ~counter~0 2)} ~cond := #in~cond; {5367#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:52,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {5367#(<= ~counter~0 2)} assume !(0 == ~cond); {5367#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:52,222 INFO L290 TraceCheckUtils]: 40: Hoare triple {5367#(<= ~counter~0 2)} assume true; {5367#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:52,222 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5367#(<= ~counter~0 2)} {5367#(<= ~counter~0 2)} #84#return; {5367#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:52,222 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-08 06:21:52,223 INFO L290 TraceCheckUtils]: 43: Hoare triple {5367#(<= ~counter~0 2)} ~cond := #in~cond; {5367#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:52,223 INFO L290 TraceCheckUtils]: 44: Hoare triple {5367#(<= ~counter~0 2)} assume !(0 == ~cond); {5367#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:52,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {5367#(<= ~counter~0 2)} assume true; {5367#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:52,224 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5367#(<= ~counter~0 2)} {5367#(<= ~counter~0 2)} #86#return; {5367#(<= ~counter~0 2)} is VALID [2022-04-08 06:21:52,224 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-08 06:21:52,224 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-08 06:21:52,225 INFO L290 TraceCheckUtils]: 49: Hoare triple {5422#(<= |main_#t~post6| 2)} assume !(#t~post6 < 50);havoc #t~post6; {5271#false} is VALID [2022-04-08 06:21:52,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {5271#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5271#false} is VALID [2022-04-08 06:21:52,225 INFO L290 TraceCheckUtils]: 51: Hoare triple {5271#false} assume !(#t~post7 < 50);havoc #t~post7; {5271#false} is VALID [2022-04-08 06:21:52,225 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-08 06:21:52,225 INFO L290 TraceCheckUtils]: 53: Hoare triple {5271#false} ~cond := #in~cond; {5271#false} is VALID [2022-04-08 06:21:52,225 INFO L290 TraceCheckUtils]: 54: Hoare triple {5271#false} assume !(0 == ~cond); {5271#false} is VALID [2022-04-08 06:21:52,225 INFO L290 TraceCheckUtils]: 55: Hoare triple {5271#false} assume true; {5271#false} is VALID [2022-04-08 06:21:52,225 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5271#false} {5271#false} #92#return; {5271#false} is VALID [2022-04-08 06:21:52,225 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-08 06:21:52,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {5271#false} ~cond := #in~cond; {5271#false} is VALID [2022-04-08 06:21:52,226 INFO L290 TraceCheckUtils]: 59: Hoare triple {5271#false} assume 0 == ~cond; {5271#false} is VALID [2022-04-08 06:21:52,226 INFO L290 TraceCheckUtils]: 60: Hoare triple {5271#false} assume !false; {5271#false} is VALID [2022-04-08 06:21:52,226 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-08 06:21:52,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:21:52,448 INFO L290 TraceCheckUtils]: 60: Hoare triple {5271#false} assume !false; {5271#false} is VALID [2022-04-08 06:21:52,448 INFO L290 TraceCheckUtils]: 59: Hoare triple {5271#false} assume 0 == ~cond; {5271#false} is VALID [2022-04-08 06:21:52,448 INFO L290 TraceCheckUtils]: 58: Hoare triple {5271#false} ~cond := #in~cond; {5271#false} is VALID [2022-04-08 06:21:52,448 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-08 06:21:52,448 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5270#true} {5271#false} #92#return; {5271#false} is VALID [2022-04-08 06:21:52,448 INFO L290 TraceCheckUtils]: 55: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-08 06:21:52,448 INFO L290 TraceCheckUtils]: 54: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-08 06:21:52,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-08 06:21:52,448 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-08 06:21:52,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {5271#false} assume !(#t~post7 < 50);havoc #t~post7; {5271#false} is VALID [2022-04-08 06:21:52,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {5271#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5271#false} is VALID [2022-04-08 06:21:52,449 INFO L290 TraceCheckUtils]: 49: Hoare triple {5492#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {5271#false} is VALID [2022-04-08 06:21:52,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {5496#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5492#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:21:52,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {5496#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5496#(< ~counter~0 50)} is VALID [2022-04-08 06:21:52,450 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5270#true} {5496#(< ~counter~0 50)} #86#return; {5496#(< ~counter~0 50)} is VALID [2022-04-08 06:21:52,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-08 06:21:52,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-08 06:21:52,450 INFO L290 TraceCheckUtils]: 43: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-08 06:21:52,450 INFO L272 TraceCheckUtils]: 42: Hoare triple {5496#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5270#true} is VALID [2022-04-08 06:21:52,451 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5270#true} {5496#(< ~counter~0 50)} #84#return; {5496#(< ~counter~0 50)} is VALID [2022-04-08 06:21:52,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-08 06:21:52,451 INFO L290 TraceCheckUtils]: 39: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-08 06:21:52,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-08 06:21:52,451 INFO L272 TraceCheckUtils]: 37: Hoare triple {5496#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5270#true} is VALID [2022-04-08 06:21:52,451 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5270#true} {5496#(< ~counter~0 50)} #82#return; {5496#(< ~counter~0 50)} is VALID [2022-04-08 06:21:52,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-08 06:21:52,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-08 06:21:52,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-08 06:21:52,452 INFO L272 TraceCheckUtils]: 32: Hoare triple {5496#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5270#true} is VALID [2022-04-08 06:21:52,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {5496#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {5496#(< ~counter~0 50)} is VALID [2022-04-08 06:21:52,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {5551#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5496#(< ~counter~0 50)} is VALID [2022-04-08 06:21:52,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {5551#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5551#(< ~counter~0 49)} is VALID [2022-04-08 06:21:52,453 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5270#true} {5551#(< ~counter~0 49)} #86#return; {5551#(< ~counter~0 49)} is VALID [2022-04-08 06:21:52,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-08 06:21:52,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-08 06:21:52,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-08 06:21:52,454 INFO L272 TraceCheckUtils]: 24: Hoare triple {5551#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5270#true} is VALID [2022-04-08 06:21:52,454 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5270#true} {5551#(< ~counter~0 49)} #84#return; {5551#(< ~counter~0 49)} is VALID [2022-04-08 06:21:52,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-08 06:21:52,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-08 06:21:52,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-08 06:21:52,454 INFO L272 TraceCheckUtils]: 19: Hoare triple {5551#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5270#true} is VALID [2022-04-08 06:21:52,455 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5270#true} {5551#(< ~counter~0 49)} #82#return; {5551#(< ~counter~0 49)} is VALID [2022-04-08 06:21:52,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-08 06:21:52,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-08 06:21:52,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-08 06:21:52,455 INFO L272 TraceCheckUtils]: 14: Hoare triple {5551#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5270#true} is VALID [2022-04-08 06:21:52,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {5551#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {5551#(< ~counter~0 49)} is VALID [2022-04-08 06:21:52,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {5606#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5551#(< ~counter~0 49)} is VALID [2022-04-08 06:21:52,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {5606#(< ~counter~0 48)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {5606#(< ~counter~0 48)} is VALID [2022-04-08 06:21:52,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5270#true} {5606#(< ~counter~0 48)} #80#return; {5606#(< ~counter~0 48)} is VALID [2022-04-08 06:21:52,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-08 06:21:52,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-08 06:21:52,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-08 06:21:52,457 INFO L272 TraceCheckUtils]: 6: Hoare triple {5606#(< ~counter~0 48)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5270#true} is VALID [2022-04-08 06:21:52,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {5606#(< ~counter~0 48)} 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 48)} is VALID [2022-04-08 06:21:52,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {5606#(< ~counter~0 48)} call #t~ret8 := main(); {5606#(< ~counter~0 48)} is VALID [2022-04-08 06:21:52,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5606#(< ~counter~0 48)} {5270#true} #96#return; {5606#(< ~counter~0 48)} is VALID [2022-04-08 06:21:52,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {5606#(< ~counter~0 48)} assume true; {5606#(< ~counter~0 48)} is VALID [2022-04-08 06:21:52,458 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 48)} is VALID [2022-04-08 06:21:52,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {5270#true} call ULTIMATE.init(); {5270#true} is VALID [2022-04-08 06:21:52,459 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-08 06:21:52,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:21:52,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912736171] [2022-04-08 06:21:52,459 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:21:52,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112939411] [2022-04-08 06:21:52,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112939411] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:21:52,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:21:52,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 06:21:52,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:21:52,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [14818431] [2022-04-08 06:21:52,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [14818431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:21:52,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:21:52,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:21:52,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598818498] [2022-04-08 06:21:52,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:21:52,460 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-08 06:21:52,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:21:52,461 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-08 06:21:52,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:21:52,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:21:52,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:52,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:21:52,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:21:52,498 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-08 06:21:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:52,689 INFO L93 Difference]: Finished difference Result 132 states and 161 transitions. [2022-04-08 06:21:52,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:21:52,689 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-08 06:21:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:21:52,689 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-08 06:21:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-08 06:21:52,690 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-08 06:21:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-08 06:21:52,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2022-04-08 06:21:52,748 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-08 06:21:52,749 INFO L225 Difference]: With dead ends: 132 [2022-04-08 06:21:52,749 INFO L226 Difference]: Without dead ends: 99 [2022-04-08 06:21:52,750 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-08 06:21:52,750 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-08 06:21:52,750 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-08 06:21:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-08 06:21:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-04-08 06:21:52,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:21:52,806 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-08 06:21:52,806 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-08 06:21:52,807 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-08 06:21:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:52,808 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-08 06:21:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-08 06:21:52,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:52,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:52,809 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-08 06:21:52,809 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-08 06:21:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:52,811 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-08 06:21:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-08 06:21:52,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:52,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:52,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:21:52,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:21:52,811 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-08 06:21:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2022-04-08 06:21:52,813 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 61 [2022-04-08 06:21:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:21:52,813 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2022-04-08 06:21:52,813 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-08 06:21:52,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 115 transitions. [2022-04-08 06:21:52,922 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-08 06:21:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-08 06:21:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 06:21:52,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:21:52,923 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-08 06:21:52,939 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-08 06:21:53,135 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-08 06:21:53,136 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:21:53,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:21:53,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1140868055, now seen corresponding path program 1 times [2022-04-08 06:21:53,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:21:53,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1433660481] [2022-04-08 06:22:01,091 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:22:01,092 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:22:01,092 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:22:01,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1140868055, now seen corresponding path program 2 times [2022-04-08 06:22:01,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:22:01,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430074034] [2022-04-08 06:22:01,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:22:01,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:22:01,102 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:22:01,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1485417099] [2022-04-08 06:22:01,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:22:01,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:22:01,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:22:01,103 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-08 06:22:01,104 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-08 06:22:01,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:22:01,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:22:01,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 06:22:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:22:01,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:22:01,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {6309#true} call ULTIMATE.init(); {6309#true} is VALID [2022-04-08 06:22:01,424 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-08 06:22:01,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {6317#(<= ~counter~0 0)} assume true; {6317#(<= ~counter~0 0)} is VALID [2022-04-08 06:22:01,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6317#(<= ~counter~0 0)} {6309#true} #96#return; {6317#(<= ~counter~0 0)} is VALID [2022-04-08 06:22:01,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {6317#(<= ~counter~0 0)} call #t~ret8 := main(); {6317#(<= ~counter~0 0)} is VALID [2022-04-08 06:22:01,425 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-08 06:22:01,426 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-08 06:22:01,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {6317#(<= ~counter~0 0)} ~cond := #in~cond; {6317#(<= ~counter~0 0)} is VALID [2022-04-08 06:22:01,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {6317#(<= ~counter~0 0)} assume !(0 == ~cond); {6317#(<= ~counter~0 0)} is VALID [2022-04-08 06:22:01,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {6317#(<= ~counter~0 0)} assume true; {6317#(<= ~counter~0 0)} is VALID [2022-04-08 06:22:01,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6317#(<= ~counter~0 0)} {6317#(<= ~counter~0 0)} #80#return; {6317#(<= ~counter~0 0)} is VALID [2022-04-08 06:22:01,427 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-08 06:22:01,428 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-08 06:22:01,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {6351#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {6351#(<= ~counter~0 1)} is VALID [2022-04-08 06:22:01,428 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-08 06:22:01,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {6351#(<= ~counter~0 1)} ~cond := #in~cond; {6351#(<= ~counter~0 1)} is VALID [2022-04-08 06:22:01,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {6351#(<= ~counter~0 1)} assume !(0 == ~cond); {6351#(<= ~counter~0 1)} is VALID [2022-04-08 06:22:01,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {6351#(<= ~counter~0 1)} assume true; {6351#(<= ~counter~0 1)} is VALID [2022-04-08 06:22:01,430 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6351#(<= ~counter~0 1)} {6351#(<= ~counter~0 1)} #82#return; {6351#(<= ~counter~0 1)} is VALID [2022-04-08 06:22:01,430 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-08 06:22:01,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {6351#(<= ~counter~0 1)} ~cond := #in~cond; {6351#(<= ~counter~0 1)} is VALID [2022-04-08 06:22:01,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {6351#(<= ~counter~0 1)} assume !(0 == ~cond); {6351#(<= ~counter~0 1)} is VALID [2022-04-08 06:22:01,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {6351#(<= ~counter~0 1)} assume true; {6351#(<= ~counter~0 1)} is VALID [2022-04-08 06:22:01,431 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6351#(<= ~counter~0 1)} {6351#(<= ~counter~0 1)} #84#return; {6351#(<= ~counter~0 1)} is VALID [2022-04-08 06:22:01,432 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-08 06:22:01,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {6351#(<= ~counter~0 1)} ~cond := #in~cond; {6351#(<= ~counter~0 1)} is VALID [2022-04-08 06:22:01,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {6351#(<= ~counter~0 1)} assume !(0 == ~cond); {6351#(<= ~counter~0 1)} is VALID [2022-04-08 06:22:01,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {6351#(<= ~counter~0 1)} assume true; {6351#(<= ~counter~0 1)} is VALID [2022-04-08 06:22:01,433 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6351#(<= ~counter~0 1)} {6351#(<= ~counter~0 1)} #86#return; {6351#(<= ~counter~0 1)} is VALID [2022-04-08 06:22:01,434 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-08 06:22:01,434 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-08 06:22:01,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {6406#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,435 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-08 06:22:01,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {6406#(<= ~counter~0 2)} ~cond := #in~cond; {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {6406#(<= ~counter~0 2)} assume !(0 == ~cond); {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {6406#(<= ~counter~0 2)} assume true; {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,436 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6406#(<= ~counter~0 2)} {6406#(<= ~counter~0 2)} #82#return; {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,437 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-08 06:22:01,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {6406#(<= ~counter~0 2)} ~cond := #in~cond; {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {6406#(<= ~counter~0 2)} assume !(0 == ~cond); {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {6406#(<= ~counter~0 2)} assume true; {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,438 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6406#(<= ~counter~0 2)} {6406#(<= ~counter~0 2)} #84#return; {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,438 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-08 06:22:01,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {6406#(<= ~counter~0 2)} ~cond := #in~cond; {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {6406#(<= ~counter~0 2)} assume !(0 == ~cond); {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {6406#(<= ~counter~0 2)} assume true; {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,439 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6406#(<= ~counter~0 2)} {6406#(<= ~counter~0 2)} #86#return; {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {6406#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {6406#(<= ~counter~0 2)} is VALID [2022-04-08 06:22:01,440 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-08 06:22:01,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {6461#(<= ~counter~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {6461#(<= ~counter~0 3)} is VALID [2022-04-08 06:22:01,441 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-08 06:22:01,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {6461#(<= ~counter~0 3)} ~cond := #in~cond; {6461#(<= ~counter~0 3)} is VALID [2022-04-08 06:22:01,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {6461#(<= ~counter~0 3)} assume !(0 == ~cond); {6461#(<= ~counter~0 3)} is VALID [2022-04-08 06:22:01,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {6461#(<= ~counter~0 3)} assume true; {6461#(<= ~counter~0 3)} is VALID [2022-04-08 06:22:01,442 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6461#(<= ~counter~0 3)} {6461#(<= ~counter~0 3)} #88#return; {6461#(<= ~counter~0 3)} is VALID [2022-04-08 06:22:01,443 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-08 06:22:01,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {6461#(<= ~counter~0 3)} ~cond := #in~cond; {6461#(<= ~counter~0 3)} is VALID [2022-04-08 06:22:01,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {6461#(<= ~counter~0 3)} assume !(0 == ~cond); {6461#(<= ~counter~0 3)} is VALID [2022-04-08 06:22:01,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {6461#(<= ~counter~0 3)} assume true; {6461#(<= ~counter~0 3)} is VALID [2022-04-08 06:22:01,444 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6461#(<= ~counter~0 3)} {6461#(<= ~counter~0 3)} #90#return; {6461#(<= ~counter~0 3)} is VALID [2022-04-08 06:22:01,444 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-08 06:22:01,444 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-08 06:22:01,445 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-08 06:22:01,445 INFO L290 TraceCheckUtils]: 63: Hoare triple {6504#(<= |main_#t~post7| 3)} assume !(#t~post7 < 50);havoc #t~post7; {6310#false} is VALID [2022-04-08 06:22:01,445 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-08 06:22:01,445 INFO L290 TraceCheckUtils]: 65: Hoare triple {6310#false} ~cond := #in~cond; {6310#false} is VALID [2022-04-08 06:22:01,445 INFO L290 TraceCheckUtils]: 66: Hoare triple {6310#false} assume 0 == ~cond; {6310#false} is VALID [2022-04-08 06:22:01,445 INFO L290 TraceCheckUtils]: 67: Hoare triple {6310#false} assume !false; {6310#false} is VALID [2022-04-08 06:22:01,446 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-08 06:22:01,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:22:01,727 INFO L290 TraceCheckUtils]: 67: Hoare triple {6310#false} assume !false; {6310#false} is VALID [2022-04-08 06:22:01,728 INFO L290 TraceCheckUtils]: 66: Hoare triple {6310#false} assume 0 == ~cond; {6310#false} is VALID [2022-04-08 06:22:01,728 INFO L290 TraceCheckUtils]: 65: Hoare triple {6310#false} ~cond := #in~cond; {6310#false} is VALID [2022-04-08 06:22:01,728 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-08 06:22:01,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {6532#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {6310#false} is VALID [2022-04-08 06:22:01,728 INFO L290 TraceCheckUtils]: 62: Hoare triple {6536#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6532#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:22:01,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {6536#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6536#(< ~counter~0 50)} is VALID [2022-04-08 06:22:01,729 INFO L290 TraceCheckUtils]: 60: Hoare triple {6536#(< ~counter~0 50)} 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 50)} is VALID [2022-04-08 06:22:01,729 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6309#true} {6536#(< ~counter~0 50)} #90#return; {6536#(< ~counter~0 50)} is VALID [2022-04-08 06:22:01,729 INFO L290 TraceCheckUtils]: 58: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-08 06:22:01,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-08 06:22:01,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-08 06:22:01,730 INFO L272 TraceCheckUtils]: 55: Hoare triple {6536#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6309#true} is VALID [2022-04-08 06:22:01,730 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6309#true} {6536#(< ~counter~0 50)} #88#return; {6536#(< ~counter~0 50)} is VALID [2022-04-08 06:22:01,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-08 06:22:01,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-08 06:22:01,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-08 06:22:01,730 INFO L272 TraceCheckUtils]: 50: Hoare triple {6536#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6309#true} is VALID [2022-04-08 06:22:01,731 INFO L290 TraceCheckUtils]: 49: Hoare triple {6536#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {6536#(< ~counter~0 50)} is VALID [2022-04-08 06:22:01,731 INFO L290 TraceCheckUtils]: 48: Hoare triple {6579#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6536#(< ~counter~0 50)} is VALID [2022-04-08 06:22:01,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {6579#(< ~counter~0 49)} assume !(~r~0 >= ~d~0); {6579#(< ~counter~0 49)} is VALID [2022-04-08 06:22:01,732 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6309#true} {6579#(< ~counter~0 49)} #86#return; {6579#(< ~counter~0 49)} is VALID [2022-04-08 06:22:01,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-08 06:22:01,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-08 06:22:01,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-08 06:22:01,732 INFO L272 TraceCheckUtils]: 42: Hoare triple {6579#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6309#true} is VALID [2022-04-08 06:22:01,733 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6309#true} {6579#(< ~counter~0 49)} #84#return; {6579#(< ~counter~0 49)} is VALID [2022-04-08 06:22:01,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-08 06:22:01,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-08 06:22:01,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-08 06:22:01,733 INFO L272 TraceCheckUtils]: 37: Hoare triple {6579#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6309#true} is VALID [2022-04-08 06:22:01,733 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6309#true} {6579#(< ~counter~0 49)} #82#return; {6579#(< ~counter~0 49)} is VALID [2022-04-08 06:22:01,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-08 06:22:01,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-08 06:22:01,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-08 06:22:01,734 INFO L272 TraceCheckUtils]: 32: Hoare triple {6579#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6309#true} is VALID [2022-04-08 06:22:01,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {6579#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {6579#(< ~counter~0 49)} is VALID [2022-04-08 06:22:01,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {6634#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6579#(< ~counter~0 49)} is VALID [2022-04-08 06:22:01,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {6634#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6634#(< ~counter~0 48)} is VALID [2022-04-08 06:22:01,735 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6309#true} {6634#(< ~counter~0 48)} #86#return; {6634#(< ~counter~0 48)} is VALID [2022-04-08 06:22:01,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-08 06:22:01,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-08 06:22:01,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-08 06:22:01,736 INFO L272 TraceCheckUtils]: 24: Hoare triple {6634#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6309#true} is VALID [2022-04-08 06:22:01,736 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6309#true} {6634#(< ~counter~0 48)} #84#return; {6634#(< ~counter~0 48)} is VALID [2022-04-08 06:22:01,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-08 06:22:01,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-08 06:22:01,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-08 06:22:01,736 INFO L272 TraceCheckUtils]: 19: Hoare triple {6634#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6309#true} is VALID [2022-04-08 06:22:01,736 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6309#true} {6634#(< ~counter~0 48)} #82#return; {6634#(< ~counter~0 48)} is VALID [2022-04-08 06:22:01,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-08 06:22:01,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-08 06:22:01,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-08 06:22:01,737 INFO L272 TraceCheckUtils]: 14: Hoare triple {6634#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6309#true} is VALID [2022-04-08 06:22:01,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {6634#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {6634#(< ~counter~0 48)} is VALID [2022-04-08 06:22:01,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {6689#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6634#(< ~counter~0 48)} is VALID [2022-04-08 06:22:01,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {6689#(< ~counter~0 47)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {6689#(< ~counter~0 47)} is VALID [2022-04-08 06:22:01,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6309#true} {6689#(< ~counter~0 47)} #80#return; {6689#(< ~counter~0 47)} is VALID [2022-04-08 06:22:01,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-08 06:22:01,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-08 06:22:01,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-08 06:22:01,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {6689#(< ~counter~0 47)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {6309#true} is VALID [2022-04-08 06:22:01,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {6689#(< ~counter~0 47)} 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 47)} is VALID [2022-04-08 06:22:01,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {6689#(< ~counter~0 47)} call #t~ret8 := main(); {6689#(< ~counter~0 47)} is VALID [2022-04-08 06:22:01,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6689#(< ~counter~0 47)} {6309#true} #96#return; {6689#(< ~counter~0 47)} is VALID [2022-04-08 06:22:01,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {6689#(< ~counter~0 47)} assume true; {6689#(< ~counter~0 47)} is VALID [2022-04-08 06:22:01,740 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 47)} is VALID [2022-04-08 06:22:01,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {6309#true} call ULTIMATE.init(); {6309#true} is VALID [2022-04-08 06:22:01,740 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-08 06:22:01,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:22:01,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430074034] [2022-04-08 06:22:01,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:22:01,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485417099] [2022-04-08 06:22:01,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485417099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:22:01,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:22:01,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 06:22:01,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:22:01,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1433660481] [2022-04-08 06:22:01,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1433660481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:22:01,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:22:01,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 06:22:01,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704502401] [2022-04-08 06:22:01,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:22:01,742 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-08 06:22:01,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:22:01,742 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-08 06:22:01,776 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-08 06:22:01,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 06:22:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:22:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 06:22:01,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:22:01,777 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-08 06:22:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:22:02,143 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2022-04-08 06:22:02,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:22:02,144 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-08 06:22:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:22:02,144 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-08 06:22:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-08 06:22:02,146 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-08 06:22:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-08 06:22:02,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-08 06:22:02,218 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-08 06:22:02,220 INFO L225 Difference]: With dead ends: 151 [2022-04-08 06:22:02,220 INFO L226 Difference]: Without dead ends: 136 [2022-04-08 06:22:02,220 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-08 06:22:02,221 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-08 06:22:02,221 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-08 06:22:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-08 06:22:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2022-04-08 06:22:02,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:22:02,317 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-08 06:22:02,317 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-08 06:22:02,317 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-08 06:22:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:22:02,319 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2022-04-08 06:22:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2022-04-08 06:22:02,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:22:02,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:22:02,320 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-08 06:22:02,320 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-08 06:22:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:22:02,322 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2022-04-08 06:22:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2022-04-08 06:22:02,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:22:02,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:22:02,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:22:02,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:22:02,323 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-08 06:22:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2022-04-08 06:22:02,325 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 68 [2022-04-08 06:22:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:22:02,325 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2022-04-08 06:22:02,325 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-08 06:22:02,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 154 transitions. [2022-04-08 06:22:02,477 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-08 06:22:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2022-04-08 06:22:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 06:22:02,477 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:22:02,477 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-08 06:22:02,494 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-08 06:22:02,678 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-08 06:22:02,678 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:22:02,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:22:02,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1142595933, now seen corresponding path program 1 times [2022-04-08 06:22:02,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:22:02,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [208532221] [2022-04-08 06:22:09,958 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:22:09,958 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:22:09,958 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:22:09,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1142595933, now seen corresponding path program 2 times [2022-04-08 06:22:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:22:09,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430652756] [2022-04-08 06:22:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:22:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:22:09,968 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:22:09,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872244458] [2022-04-08 06:22:09,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:22:09,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:22:09,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:22:09,969 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-08 06:22:09,972 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-08 06:22:10,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:22:10,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:22:10,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 06:22:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:22:10,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:22:13,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {7570#true} call ULTIMATE.init(); {7570#true} is VALID [2022-04-08 06:22:13,905 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-08 06:22:13,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:13,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7570#true} {7570#true} #96#return; {7570#true} is VALID [2022-04-08 06:22:13,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {7570#true} call #t~ret8 := main(); {7570#true} is VALID [2022-04-08 06:22:13,905 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-08 06:22:13,905 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-08 06:22:13,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:13,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:13,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:13,906 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7570#true} {7570#true} #80#return; {7570#true} is VALID [2022-04-08 06:22:13,906 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-08 06:22:13,906 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-08 06:22:13,907 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 < 50);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-08 06:22:13,907 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-08 06:22:13,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:13,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:13,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:13,908 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-08 06:22:13,908 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-08 06:22:13,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:13,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:13,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:13,908 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-08 06:22:13,908 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-08 06:22:13,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:13,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:13,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:13,909 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-08 06:22:13,910 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-08 06:22:13,911 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-08 06:22:13,911 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 < 50);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-08 06:22:13,911 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-08 06:22:13,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:13,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:13,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:13,912 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-08 06:22:13,912 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-08 06:22:13,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:13,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:13,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:13,913 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-08 06:22:13,913 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-08 06:22:13,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:13,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:13,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:13,913 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-08 06:22:13,914 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-08 06:22:13,914 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-08 06:22:13,915 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 < 50);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-08 06:22:13,915 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-08 06:22:13,915 INFO L290 TraceCheckUtils]: 51: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:13,915 INFO L290 TraceCheckUtils]: 52: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:13,915 INFO L290 TraceCheckUtils]: 53: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:13,916 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-08 06:22:13,916 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-08 06:22:13,916 INFO L290 TraceCheckUtils]: 56: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:13,916 INFO L290 TraceCheckUtils]: 57: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:13,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:13,916 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-08 06:22:13,918 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-08 06:22:13,919 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-08 06:22:13,919 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-08 06:22:13,919 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 < 50);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-08 06:22:13,920 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-08 06:22:13,920 INFO L290 TraceCheckUtils]: 65: Hoare triple {7772#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7776#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:22:13,921 INFO L290 TraceCheckUtils]: 66: Hoare triple {7776#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7571#false} is VALID [2022-04-08 06:22:13,921 INFO L290 TraceCheckUtils]: 67: Hoare triple {7571#false} assume !false; {7571#false} is VALID [2022-04-08 06:22:13,921 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-08 06:22:13,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:22:21,358 INFO L290 TraceCheckUtils]: 67: Hoare triple {7571#false} assume !false; {7571#false} is VALID [2022-04-08 06:22:21,359 INFO L290 TraceCheckUtils]: 66: Hoare triple {7776#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7571#false} is VALID [2022-04-08 06:22:21,359 INFO L290 TraceCheckUtils]: 65: Hoare triple {7772#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7776#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:22:21,360 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-08 06:22:21,360 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 < 50);havoc #t~post7; {7792#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:22:21,360 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-08 06:22:21,362 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-08 06:22:21,371 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-08 06:22:21,372 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-08 06:22:21,372 INFO L290 TraceCheckUtils]: 58: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:21,372 INFO L290 TraceCheckUtils]: 57: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:21,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:21,372 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-08 06:22:21,388 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-08 06:22:21,388 INFO L290 TraceCheckUtils]: 53: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:21,388 INFO L290 TraceCheckUtils]: 52: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:21,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:21,388 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-08 06:22:21,389 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 < 50);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-08 06:22:21,390 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-08 06:22:21,391 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-08 06:22:21,392 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-08 06:22:21,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:21,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:21,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:21,392 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-08 06:22:21,393 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-08 06:22:21,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:21,393 INFO L290 TraceCheckUtils]: 39: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:21,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:21,393 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-08 06:22:21,393 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-08 06:22:21,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:21,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:21,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:21,394 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-08 06:22:21,395 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 < 50);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-08 06:22:21,396 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-08 06:22:21,399 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-08 06:22:21,400 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-08 06:22:21,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:21,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:21,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:21,400 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-08 06:22:21,401 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-08 06:22:21,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:21,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:21,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:21,401 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-08 06:22:21,402 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-08 06:22:21,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:21,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:21,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:21,402 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-08 06:22:21,403 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 < 50);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-08 06:22:21,403 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-08 06:22:21,404 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-08 06:22:21,404 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7570#true} {7570#true} #80#return; {7570#true} is VALID [2022-04-08 06:22:21,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:21,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-08 06:22:21,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-08 06:22:21,405 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-08 06:22:21,405 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-08 06:22:21,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {7570#true} call #t~ret8 := main(); {7570#true} is VALID [2022-04-08 06:22:21,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7570#true} {7570#true} #96#return; {7570#true} is VALID [2022-04-08 06:22:21,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-08 06:22:21,405 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-08 06:22:21,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {7570#true} call ULTIMATE.init(); {7570#true} is VALID [2022-04-08 06:22:21,406 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-08 06:22:21,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:22:21,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430652756] [2022-04-08 06:22:21,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:22:21,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872244458] [2022-04-08 06:22:21,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872244458] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:22:21,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:22:21,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 06:22:21,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:22:21,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [208532221] [2022-04-08 06:22:21,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [208532221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:22:21,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:22:21,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:22:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318579006] [2022-04-08 06:22:21,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:22:21,407 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-08 06:22:21,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:22:21,407 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-08 06:22:21,449 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-08 06:22:21,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:22:21,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:22:21,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:22:21,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:22:21,450 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-08 06:22:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:22:22,305 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2022-04-08 06:22:22,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 06:22:22,306 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-08 06:22:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:22:22,306 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-08 06:22:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-08 06:22:22,307 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-08 06:22:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-08 06:22:22,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-08 06:22:22,393 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-08 06:22:22,395 INFO L225 Difference]: With dead ends: 178 [2022-04-08 06:22:22,395 INFO L226 Difference]: Without dead ends: 143 [2022-04-08 06:22:22,395 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-08 06:22:22,395 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-08 06:22:22,396 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-08 06:22:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-08 06:22:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-04-08 06:22:22,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:22:22,518 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-08 06:22:22,518 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-08 06:22:22,518 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-08 06:22:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:22:22,520 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2022-04-08 06:22:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 165 transitions. [2022-04-08 06:22:22,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:22:22,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:22:22,521 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-08 06:22:22,521 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-08 06:22:22,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:22:22,527 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2022-04-08 06:22:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 165 transitions. [2022-04-08 06:22:22,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:22:22,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:22:22,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:22:22,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:22:22,529 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-08 06:22:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 162 transitions. [2022-04-08 06:22:22,531 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 162 transitions. Word has length 68 [2022-04-08 06:22:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:22:22,531 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 162 transitions. [2022-04-08 06:22:22,531 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-08 06:22:22,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 162 transitions. [2022-04-08 06:22:22,682 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-08 06:22:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 162 transitions. [2022-04-08 06:22:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 06:22:22,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:22:22,687 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-08 06:22:22,703 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-08 06:22:22,888 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-08 06:22:22,888 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:22:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:22:22,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1390565976, now seen corresponding path program 3 times [2022-04-08 06:22:22,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:22:22,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [980569623] [2022-04-08 06:22:28,804 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:22:28,804 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:22:28,805 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:22:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1390565976, now seen corresponding path program 4 times [2022-04-08 06:22:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:22:28,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933474198] [2022-04-08 06:22:28,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:22:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:22:28,814 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:22:28,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1317332019] [2022-04-08 06:22:28,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:22:28,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:22:28,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:22:28,815 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-08 06:22:28,816 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-08 06:22:28,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:22:28,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:22:28,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 06:22:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:22:28,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:22:41,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {8917#true} call ULTIMATE.init(); {8917#true} is VALID [2022-04-08 06:22:41,863 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-08 06:22:41,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:22:41,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8917#true} {8917#true} #96#return; {8917#true} is VALID [2022-04-08 06:22:41,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {8917#true} call #t~ret8 := main(); {8917#true} is VALID [2022-04-08 06:22:41,863 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-08 06:22:41,863 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-08 06:22:41,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:22:41,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:22:41,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:22:41,863 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8917#true} {8917#true} #80#return; {8917#true} is VALID [2022-04-08 06:22:41,864 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-08 06:22:41,864 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-08 06:22:41,865 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 < 50);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-08 06:22:41,865 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-08 06:22:41,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:22:41,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:22:41,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:22:41,865 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-08 06:22:41,865 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-08 06:22:41,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:22:41,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:22:41,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:22:41,866 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-08 06:22:41,866 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-08 06:22:41,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:22:41,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:22:41,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:22:41,867 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-08 06:22:41,868 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-08 06:22:41,869 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-08 06:22:41,869 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 < 50);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-08 06:22:41,869 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-08 06:22:41,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:22:41,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:22:41,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:22:41,870 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-08 06:22:41,870 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-08 06:22:41,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:22:41,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:22:41,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:22:41,871 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-08 06:22:41,871 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-08 06:22:41,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:22:41,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:22:41,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:22:41,872 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-08 06:22:41,872 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-08 06:22:41,872 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-08 06:22:41,873 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 < 50);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-08 06:22:41,873 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-08 06:22:41,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:22:41,873 INFO L290 TraceCheckUtils]: 52: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:22:41,873 INFO L290 TraceCheckUtils]: 53: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:22:41,874 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-08 06:22:41,874 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-08 06:22:41,874 INFO L290 TraceCheckUtils]: 56: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:22:41,874 INFO L290 TraceCheckUtils]: 57: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:22:41,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:22:41,883 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-08 06:22:41,885 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-08 06:22:41,887 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-08 06:22:41,887 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-08 06:22:41,888 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 < 50);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-08 06:22:41,888 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-08 06:22:41,888 INFO L290 TraceCheckUtils]: 65: Hoare triple {8917#true} ~cond := #in~cond; {9122#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:22:41,889 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-08 06:22:41,889 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-08 06:22:41,897 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-08 06:22:41,899 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-08 06:22:41,899 INFO L290 TraceCheckUtils]: 70: Hoare triple {9137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:22:41,899 INFO L290 TraceCheckUtils]: 71: Hoare triple {9141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8918#false} is VALID [2022-04-08 06:22:41,900 INFO L290 TraceCheckUtils]: 72: Hoare triple {8918#false} assume !false; {8918#false} is VALID [2022-04-08 06:22:41,900 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-08 06:22:41,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:23:12,173 INFO L290 TraceCheckUtils]: 72: Hoare triple {8918#false} assume !false; {8918#false} is VALID [2022-04-08 06:23:12,174 INFO L290 TraceCheckUtils]: 71: Hoare triple {9141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8918#false} is VALID [2022-04-08 06:23:12,174 INFO L290 TraceCheckUtils]: 70: Hoare triple {9137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:23:12,175 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-08 06:23:12,175 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-08 06:23:12,176 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-08 06:23:12,176 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-08 06:23:12,176 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-08 06:23:12,176 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-08 06:23:12,177 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 < 50);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-08 06:23:12,177 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-08 06:23:12,179 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-08 06:23:12,187 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-08 06:23:12,190 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-08 06:23:12,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:23:12,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:23:12,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:23:12,190 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-08 06:23:12,191 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-08 06:23:12,191 INFO L290 TraceCheckUtils]: 53: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:23:12,191 INFO L290 TraceCheckUtils]: 52: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:23:12,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:23:12,191 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-08 06:23:12,192 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 < 50);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-08 06:23:12,193 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-08 06:23:12,194 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-08 06:23:12,195 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-08 06:23:12,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:23:12,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:23:12,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:23:12,195 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-08 06:23:12,203 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-08 06:23:12,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:23:12,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:23:12,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:23:12,204 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-08 06:23:12,204 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-08 06:23:12,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:23:12,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:23:12,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:23:12,204 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-08 06:23:12,205 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 < 50);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-08 06:23:12,206 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-08 06:23:12,209 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-08 06:23:12,210 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-08 06:23:12,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:23:12,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:23:12,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:23:12,210 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-08 06:23:12,210 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-08 06:23:12,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:23:12,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:23:12,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:23:12,211 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-08 06:23:12,213 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-08 06:23:12,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:23:12,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:23:12,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:23:12,214 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-08 06:23:12,214 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 < 50);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-08 06:23:12,215 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-08 06:23:12,215 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-08 06:23:12,215 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8917#true} {8917#true} #80#return; {8917#true} is VALID [2022-04-08 06:23:12,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:23:12,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-08 06:23:12,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-08 06:23:12,215 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-08 06:23:12,215 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-08 06:23:12,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {8917#true} call #t~ret8 := main(); {8917#true} is VALID [2022-04-08 06:23:12,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8917#true} {8917#true} #96#return; {8917#true} is VALID [2022-04-08 06:23:12,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-08 06:23:12,216 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-08 06:23:12,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {8917#true} call ULTIMATE.init(); {8917#true} is VALID [2022-04-08 06:23:12,216 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-08 06:23:12,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:23:12,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933474198] [2022-04-08 06:23:12,216 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:23:12,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317332019] [2022-04-08 06:23:12,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317332019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:23:12,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:23:12,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-08 06:23:12,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:23:12,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [980569623] [2022-04-08 06:23:12,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [980569623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:23:12,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:23:12,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 06:23:12,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010326783] [2022-04-08 06:23:12,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:23:12,218 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-08 06:23:12,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:23:12,218 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-08 06:23:12,283 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-08 06:23:12,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 06:23:12,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:23:12,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 06:23:12,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-04-08 06:23:12,285 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-08 06:23:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:23:14,374 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2022-04-08 06:23:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 06:23:14,374 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-08 06:23:14,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:23:14,375 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-08 06:23:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2022-04-08 06:23:14,376 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-08 06:23:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2022-04-08 06:23:14,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 80 transitions. [2022-04-08 06:23:14,466 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-08 06:23:14,469 INFO L225 Difference]: With dead ends: 149 [2022-04-08 06:23:14,469 INFO L226 Difference]: Without dead ends: 147 [2022-04-08 06:23:14,469 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-04-08 06:23:14,469 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-08 06:23:14,469 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.9s Time] [2022-04-08 06:23:14,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-08 06:23:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-04-08 06:23:14,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:23:14,606 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-08 06:23:14,607 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-08 06:23:14,607 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-08 06:23:14,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:23:14,609 INFO L93 Difference]: Finished difference Result 147 states and 169 transitions. [2022-04-08 06:23:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2022-04-08 06:23:14,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:23:14,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:23:14,610 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-08 06:23:14,610 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-08 06:23:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:23:14,612 INFO L93 Difference]: Finished difference Result 147 states and 169 transitions. [2022-04-08 06:23:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2022-04-08 06:23:14,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:23:14,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:23:14,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:23:14,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:23:14,613 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-08 06:23:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2022-04-08 06:23:14,616 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 73 [2022-04-08 06:23:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:23:14,616 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2022-04-08 06:23:14,616 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-08 06:23:14,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 169 transitions. [2022-04-08 06:23:14,816 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-08 06:23:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2022-04-08 06:23:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 06:23:14,816 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:23:14,817 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-08 06:23:14,832 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-08 06:23:15,019 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-08 06:23:15,019 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:23:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:23:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1792978632, now seen corresponding path program 1 times [2022-04-08 06:23:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:23:15,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1125264015] [2022-04-08 06:23:21,756 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:23:21,756 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:23:21,757 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:23:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1792978632, now seen corresponding path program 2 times [2022-04-08 06:23:21,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:23:21,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406029472] [2022-04-08 06:23:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:23:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:23:21,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:23:21,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [280556740] [2022-04-08 06:23:21,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:23:21,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:23:21,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:23:21,766 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-08 06:23:21,790 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-08 06:23:21,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:23:21,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:23:21,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 06:23:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:23:21,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:24:00,237 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:24:06,262 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:24:25,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {10265#true} call ULTIMATE.init(); {10265#true} is VALID [2022-04-08 06:24:25,922 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-08 06:24:25,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:24:25,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10265#true} {10265#true} #96#return; {10265#true} is VALID [2022-04-08 06:24:25,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {10265#true} call #t~ret8 := main(); {10265#true} is VALID [2022-04-08 06:24:25,922 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-08 06:24:25,922 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-08 06:24:25,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:24:25,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:24:25,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:24:25,922 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10265#true} {10265#true} #80#return; {10265#true} is VALID [2022-04-08 06:24:25,923 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-08 06:24:25,923 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-08 06:24:25,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-08 06:24:25,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-08 06:24:25,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:24:25,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:24:25,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:24:25,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-08 06:24:25,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-08 06:24:25,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:24:25,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:24:25,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:24:25,925 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-08 06:24:25,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-08 06:24:25,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:24:25,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:24:25,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:24:25,926 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-08 06:24:25,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-08 06:24:25,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-08 06:24:25,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-08 06:24:25,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-08 06:24:25,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:24:25,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:24:25,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:24:25,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-08 06:24:25,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-08 06:24:25,927 INFO L290 TraceCheckUtils]: 38: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:24:25,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:24:25,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:24:25,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-08 06:24:25,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-08 06:24:25,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:24:25,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:24:25,928 INFO L290 TraceCheckUtils]: 45: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:24:25,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-08 06:24:25,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-08 06:24:25,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-08 06:24:25,930 INFO L290 TraceCheckUtils]: 49: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-08 06:24:25,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-08 06:24:25,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:24:25,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:24:25,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:24:25,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-08 06:24:25,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-08 06:24:25,931 INFO L290 TraceCheckUtils]: 56: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:24:25,931 INFO L290 TraceCheckUtils]: 57: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:24:25,931 INFO L290 TraceCheckUtils]: 58: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:24:25,931 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-08 06:24:25,932 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-08 06:24:25,933 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-08 06:24:25,933 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-08 06:24:25,934 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 < 50);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-08 06:24:25,934 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-08 06:24:25,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {10265#true} ~cond := #in~cond; {10467#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:24:25,934 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-08 06:24:25,935 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-08 06:24:25,936 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-08 06:24:25,936 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-08 06:24:25,936 INFO L290 TraceCheckUtils]: 70: Hoare triple {10265#true} ~cond := #in~cond; {10467#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:24:25,936 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-08 06:24:25,937 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-08 06:24:27,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-08 06:24:27,943 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-08 06:24:27,946 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-08 06:24:27,946 INFO L290 TraceCheckUtils]: 76: Hoare triple {10502#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10506#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:24:27,947 INFO L290 TraceCheckUtils]: 77: Hoare triple {10506#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10266#false} is VALID [2022-04-08 06:24:27,947 INFO L290 TraceCheckUtils]: 78: Hoare triple {10266#false} assume !false; {10266#false} is VALID [2022-04-08 06:24:27,947 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-08 06:24:27,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:25:17,853 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:25:23,878 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:25:41,743 INFO L290 TraceCheckUtils]: 78: Hoare triple {10266#false} assume !false; {10266#false} is VALID [2022-04-08 06:25:41,743 INFO L290 TraceCheckUtils]: 77: Hoare triple {10506#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10266#false} is VALID [2022-04-08 06:25:41,743 INFO L290 TraceCheckUtils]: 76: Hoare triple {10502#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10506#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:25:41,744 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-08 06:25:41,745 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-08 06:25:41,745 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-08 06:25:41,746 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-08 06:25:41,746 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-08 06:25:41,746 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-08 06:25:41,747 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-08 06:25:41,749 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-08 06:25:41,749 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-08 06:25:41,750 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-08 06:25:41,750 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-08 06:25:41,750 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-08 06:25:41,750 INFO L290 TraceCheckUtils]: 63: Hoare triple {10265#true} assume !!(#t~post7 < 50);havoc #t~post7; {10265#true} is VALID [2022-04-08 06:25:41,750 INFO L290 TraceCheckUtils]: 62: Hoare triple {10265#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10265#true} is VALID [2022-04-08 06:25:41,750 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-08 06:25:41,750 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-08 06:25:41,750 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10265#true} {10265#true} #90#return; {10265#true} is VALID [2022-04-08 06:25:41,750 INFO L290 TraceCheckUtils]: 58: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:25:41,751 INFO L290 TraceCheckUtils]: 57: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:25:41,751 INFO L290 TraceCheckUtils]: 56: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:25:41,751 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-08 06:25:41,751 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10265#true} {10265#true} #88#return; {10265#true} is VALID [2022-04-08 06:25:41,751 INFO L290 TraceCheckUtils]: 53: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:25:41,751 INFO L290 TraceCheckUtils]: 52: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:25:41,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:25:41,751 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-08 06:25:41,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {10265#true} assume !!(#t~post7 < 50);havoc #t~post7; {10265#true} is VALID [2022-04-08 06:25:41,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {10265#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10265#true} is VALID [2022-04-08 06:25:41,751 INFO L290 TraceCheckUtils]: 47: Hoare triple {10265#true} assume !(~r~0 >= ~d~0); {10265#true} is VALID [2022-04-08 06:25:41,751 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10265#true} {10265#true} #86#return; {10265#true} is VALID [2022-04-08 06:25:41,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:25:41,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:25:41,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:25:41,752 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-08 06:25:41,752 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10265#true} {10265#true} #84#return; {10265#true} is VALID [2022-04-08 06:25:41,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:25:41,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:25:41,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:25:41,752 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-08 06:25:41,752 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10265#true} {10265#true} #82#return; {10265#true} is VALID [2022-04-08 06:25:41,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:25:41,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:25:41,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:25:41,752 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-08 06:25:41,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {10265#true} assume !!(#t~post6 < 50);havoc #t~post6; {10265#true} is VALID [2022-04-08 06:25:41,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {10265#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10265#true} is VALID [2022-04-08 06:25:41,752 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-08 06:25:41,753 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10265#true} {10265#true} #86#return; {10265#true} is VALID [2022-04-08 06:25:41,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:25:41,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:25:41,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:25:41,753 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-08 06:25:41,753 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10265#true} {10265#true} #84#return; {10265#true} is VALID [2022-04-08 06:25:41,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:25:41,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:25:41,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:25:41,753 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-08 06:25:41,753 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10265#true} {10265#true} #82#return; {10265#true} is VALID [2022-04-08 06:25:41,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:25:41,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:25:41,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:25:41,754 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-08 06:25:41,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {10265#true} assume !!(#t~post6 < 50);havoc #t~post6; {10265#true} is VALID [2022-04-08 06:25:41,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {10265#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10265#true} is VALID [2022-04-08 06:25:41,754 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-08 06:25:41,754 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10265#true} {10265#true} #80#return; {10265#true} is VALID [2022-04-08 06:25:41,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:25:41,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-08 06:25:41,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-08 06:25:41,754 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-08 06:25:41,754 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-08 06:25:41,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {10265#true} call #t~ret8 := main(); {10265#true} is VALID [2022-04-08 06:25:41,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10265#true} {10265#true} #96#return; {10265#true} is VALID [2022-04-08 06:25:41,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-08 06:25:41,754 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-08 06:25:41,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {10265#true} call ULTIMATE.init(); {10265#true} is VALID [2022-04-08 06:25:41,755 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-08 06:25:41,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:25:41,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406029472] [2022-04-08 06:25:41,755 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:25:41,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280556740] [2022-04-08 06:25:41,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280556740] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:25:41,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:25:41,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-04-08 06:25:41,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:25:41,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1125264015] [2022-04-08 06:25:41,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1125264015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:25:41,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:25:41,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:25:41,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381547782] [2022-04-08 06:25:41,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:25:41,756 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-08 06:25:41,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:25:41,757 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-08 06:25:43,809 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-08 06:25:43,809 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:25:43,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:25:43,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:25:43,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-08 06:25:43,810 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-08 06:25:47,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:25:53,902 WARN L232 SmtUtils]: Spent 6.36s 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-08 06:25:54,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:25:54,497 INFO L93 Difference]: Finished difference Result 164 states and 192 transitions. [2022-04-08 06:25:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 06:25:54,497 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-08 06:25:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:25:54,497 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-08 06:25:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-04-08 06:25:54,499 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-08 06:25:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-04-08 06:25:54,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 76 transitions. [2022-04-08 06:25:56,585 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-08 06:25:56,589 INFO L225 Difference]: With dead ends: 164 [2022-04-08 06:25:56,589 INFO L226 Difference]: Without dead ends: 162 [2022-04-08 06:25:56,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-08 06:25:56,590 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-08 06:25:56,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 203 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 206 Invalid, 1 Unknown, 40 Unchecked, 2.8s Time] [2022-04-08 06:25:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-08 06:25:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2022-04-08 06:25:56,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:25:56,762 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-08 06:25:56,762 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-08 06:25:56,762 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-08 06:25:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:25:56,765 INFO L93 Difference]: Finished difference Result 162 states and 190 transitions. [2022-04-08 06:25:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2022-04-08 06:25:56,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:25:56,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:25:56,766 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-08 06:25:56,766 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-08 06:25:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:25:56,769 INFO L93 Difference]: Finished difference Result 162 states and 190 transitions. [2022-04-08 06:25:56,769 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2022-04-08 06:25:56,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:25:56,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:25:56,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:25:56,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:25:56,770 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-08 06:25:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 185 transitions. [2022-04-08 06:25:56,772 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 185 transitions. Word has length 79 [2022-04-08 06:25:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:25:56,773 INFO L478 AbstractCegarLoop]: Abstraction has 158 states and 185 transitions. [2022-04-08 06:25:56,773 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-08 06:25:56,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 158 states and 185 transitions. [2022-04-08 06:25:59,023 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-08 06:25:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2022-04-08 06:25:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 06:25:59,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:25:59,024 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-08 06:25:59,044 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-08 06:25:59,224 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-08 06:25:59,224 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:25:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:25:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash 816704307, now seen corresponding path program 5 times [2022-04-08 06:25:59,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:25:59,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1187896023] [2022-04-08 06:26:06,365 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:26:06,365 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:26:06,365 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:26:06,365 INFO L85 PathProgramCache]: Analyzing trace with hash 816704307, now seen corresponding path program 6 times [2022-04-08 06:26:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:26:06,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756794714] [2022-04-08 06:26:06,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:26:06,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:26:06,374 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:26:06,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805286991] [2022-04-08 06:26:06,374 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:26:06,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:26:06,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:26:06,375 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-08 06:26:06,376 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-08 06:26:06,430 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 06:26:06,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:26:06,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 06:26:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:26:06,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:26:06,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {11727#true} call ULTIMATE.init(); {11727#true} is VALID [2022-04-08 06:26:06,739 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-08 06:26:06,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {11735#(<= ~counter~0 0)} assume true; {11735#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:06,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11735#(<= ~counter~0 0)} {11727#true} #96#return; {11735#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:06,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {11735#(<= ~counter~0 0)} call #t~ret8 := main(); {11735#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:06,740 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-08 06:26:06,740 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-08 06:26:06,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {11735#(<= ~counter~0 0)} ~cond := #in~cond; {11735#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:06,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {11735#(<= ~counter~0 0)} assume !(0 == ~cond); {11735#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:06,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {11735#(<= ~counter~0 0)} assume true; {11735#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:06,742 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11735#(<= ~counter~0 0)} {11735#(<= ~counter~0 0)} #80#return; {11735#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:06,742 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-08 06:26:06,743 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-08 06:26:06,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {11769#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {11769#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:06,743 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-08 06:26:06,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {11769#(<= ~counter~0 1)} ~cond := #in~cond; {11769#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:06,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {11769#(<= ~counter~0 1)} assume !(0 == ~cond); {11769#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:06,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {11769#(<= ~counter~0 1)} assume true; {11769#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:06,744 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11769#(<= ~counter~0 1)} {11769#(<= ~counter~0 1)} #82#return; {11769#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:06,745 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-08 06:26:06,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {11769#(<= ~counter~0 1)} ~cond := #in~cond; {11769#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:06,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {11769#(<= ~counter~0 1)} assume !(0 == ~cond); {11769#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:06,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {11769#(<= ~counter~0 1)} assume true; {11769#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:06,746 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11769#(<= ~counter~0 1)} {11769#(<= ~counter~0 1)} #84#return; {11769#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:06,747 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-08 06:26:06,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {11769#(<= ~counter~0 1)} ~cond := #in~cond; {11769#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:06,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {11769#(<= ~counter~0 1)} assume !(0 == ~cond); {11769#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:06,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {11769#(<= ~counter~0 1)} assume true; {11769#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:06,748 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11769#(<= ~counter~0 1)} {11769#(<= ~counter~0 1)} #86#return; {11769#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:06,748 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-08 06:26:06,749 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-08 06:26:06,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {11824#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {11824#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:06,749 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-08 06:26:06,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {11824#(<= ~counter~0 2)} ~cond := #in~cond; {11824#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:06,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {11824#(<= ~counter~0 2)} assume !(0 == ~cond); {11824#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:06,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {11824#(<= ~counter~0 2)} assume true; {11824#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:06,750 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11824#(<= ~counter~0 2)} {11824#(<= ~counter~0 2)} #82#return; {11824#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:06,751 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-08 06:26:06,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {11824#(<= ~counter~0 2)} ~cond := #in~cond; {11824#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:06,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {11824#(<= ~counter~0 2)} assume !(0 == ~cond); {11824#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:06,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {11824#(<= ~counter~0 2)} assume true; {11824#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:06,752 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11824#(<= ~counter~0 2)} {11824#(<= ~counter~0 2)} #84#return; {11824#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:06,753 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-08 06:26:06,753 INFO L290 TraceCheckUtils]: 43: Hoare triple {11824#(<= ~counter~0 2)} ~cond := #in~cond; {11824#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:06,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {11824#(<= ~counter~0 2)} assume !(0 == ~cond); {11824#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:06,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {11824#(<= ~counter~0 2)} assume true; {11824#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:06,754 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11824#(<= ~counter~0 2)} {11824#(<= ~counter~0 2)} #86#return; {11824#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:06,754 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-08 06:26:06,755 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-08 06:26:06,755 INFO L290 TraceCheckUtils]: 49: Hoare triple {11879#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {11879#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:06,755 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-08 06:26:06,756 INFO L290 TraceCheckUtils]: 51: Hoare triple {11879#(<= ~counter~0 3)} ~cond := #in~cond; {11879#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:06,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {11879#(<= ~counter~0 3)} assume !(0 == ~cond); {11879#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:06,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {11879#(<= ~counter~0 3)} assume true; {11879#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:06,756 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11879#(<= ~counter~0 3)} {11879#(<= ~counter~0 3)} #82#return; {11879#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:06,757 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-08 06:26:06,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {11879#(<= ~counter~0 3)} ~cond := #in~cond; {11879#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:06,757 INFO L290 TraceCheckUtils]: 57: Hoare triple {11879#(<= ~counter~0 3)} assume !(0 == ~cond); {11879#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:06,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {11879#(<= ~counter~0 3)} assume true; {11879#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:06,758 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11879#(<= ~counter~0 3)} {11879#(<= ~counter~0 3)} #84#return; {11879#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:06,759 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-08 06:26:06,759 INFO L290 TraceCheckUtils]: 61: Hoare triple {11879#(<= ~counter~0 3)} ~cond := #in~cond; {11879#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:06,759 INFO L290 TraceCheckUtils]: 62: Hoare triple {11879#(<= ~counter~0 3)} assume !(0 == ~cond); {11879#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:06,759 INFO L290 TraceCheckUtils]: 63: Hoare triple {11879#(<= ~counter~0 3)} assume true; {11879#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:06,760 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {11879#(<= ~counter~0 3)} {11879#(<= ~counter~0 3)} #86#return; {11879#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:06,760 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-08 06:26:06,760 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-08 06:26:06,761 INFO L290 TraceCheckUtils]: 67: Hoare triple {11934#(<= |main_#t~post6| 3)} assume !(#t~post6 < 50);havoc #t~post6; {11728#false} is VALID [2022-04-08 06:26:06,761 INFO L290 TraceCheckUtils]: 68: Hoare triple {11728#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11728#false} is VALID [2022-04-08 06:26:06,761 INFO L290 TraceCheckUtils]: 69: Hoare triple {11728#false} assume !(#t~post7 < 50);havoc #t~post7; {11728#false} is VALID [2022-04-08 06:26:06,761 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-08 06:26:06,761 INFO L290 TraceCheckUtils]: 71: Hoare triple {11728#false} ~cond := #in~cond; {11728#false} is VALID [2022-04-08 06:26:06,761 INFO L290 TraceCheckUtils]: 72: Hoare triple {11728#false} assume !(0 == ~cond); {11728#false} is VALID [2022-04-08 06:26:06,761 INFO L290 TraceCheckUtils]: 73: Hoare triple {11728#false} assume true; {11728#false} is VALID [2022-04-08 06:26:06,761 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11728#false} {11728#false} #92#return; {11728#false} is VALID [2022-04-08 06:26:06,761 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-08 06:26:06,762 INFO L290 TraceCheckUtils]: 76: Hoare triple {11728#false} ~cond := #in~cond; {11728#false} is VALID [2022-04-08 06:26:06,762 INFO L290 TraceCheckUtils]: 77: Hoare triple {11728#false} assume 0 == ~cond; {11728#false} is VALID [2022-04-08 06:26:06,762 INFO L290 TraceCheckUtils]: 78: Hoare triple {11728#false} assume !false; {11728#false} is VALID [2022-04-08 06:26:06,762 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-08 06:26:06,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:26:07,036 INFO L290 TraceCheckUtils]: 78: Hoare triple {11728#false} assume !false; {11728#false} is VALID [2022-04-08 06:26:07,036 INFO L290 TraceCheckUtils]: 77: Hoare triple {11728#false} assume 0 == ~cond; {11728#false} is VALID [2022-04-08 06:26:07,037 INFO L290 TraceCheckUtils]: 76: Hoare triple {11728#false} ~cond := #in~cond; {11728#false} is VALID [2022-04-08 06:26:07,037 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-08 06:26:07,037 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11727#true} {11728#false} #92#return; {11728#false} is VALID [2022-04-08 06:26:07,037 INFO L290 TraceCheckUtils]: 73: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-08 06:26:07,037 INFO L290 TraceCheckUtils]: 72: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-08 06:26:07,037 INFO L290 TraceCheckUtils]: 71: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-08 06:26:07,037 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-08 06:26:07,037 INFO L290 TraceCheckUtils]: 69: Hoare triple {11728#false} assume !(#t~post7 < 50);havoc #t~post7; {11728#false} is VALID [2022-04-08 06:26:07,037 INFO L290 TraceCheckUtils]: 68: Hoare triple {11728#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11728#false} is VALID [2022-04-08 06:26:07,037 INFO L290 TraceCheckUtils]: 67: Hoare triple {12004#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {11728#false} is VALID [2022-04-08 06:26:07,038 INFO L290 TraceCheckUtils]: 66: Hoare triple {12008#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12004#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:26:07,038 INFO L290 TraceCheckUtils]: 65: Hoare triple {12008#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12008#(< ~counter~0 50)} is VALID [2022-04-08 06:26:07,038 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {11727#true} {12008#(< ~counter~0 50)} #86#return; {12008#(< ~counter~0 50)} is VALID [2022-04-08 06:26:07,038 INFO L290 TraceCheckUtils]: 63: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-08 06:26:07,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-08 06:26:07,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-08 06:26:07,039 INFO L272 TraceCheckUtils]: 60: Hoare triple {12008#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11727#true} is VALID [2022-04-08 06:26:07,039 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11727#true} {12008#(< ~counter~0 50)} #84#return; {12008#(< ~counter~0 50)} is VALID [2022-04-08 06:26:07,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-08 06:26:07,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-08 06:26:07,039 INFO L290 TraceCheckUtils]: 56: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-08 06:26:07,039 INFO L272 TraceCheckUtils]: 55: Hoare triple {12008#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11727#true} is VALID [2022-04-08 06:26:07,040 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11727#true} {12008#(< ~counter~0 50)} #82#return; {12008#(< ~counter~0 50)} is VALID [2022-04-08 06:26:07,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-08 06:26:07,040 INFO L290 TraceCheckUtils]: 52: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-08 06:26:07,040 INFO L290 TraceCheckUtils]: 51: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-08 06:26:07,040 INFO L272 TraceCheckUtils]: 50: Hoare triple {12008#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11727#true} is VALID [2022-04-08 06:26:07,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {12008#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {12008#(< ~counter~0 50)} is VALID [2022-04-08 06:26:07,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {12063#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12008#(< ~counter~0 50)} is VALID [2022-04-08 06:26:07,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {12063#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12063#(< ~counter~0 49)} is VALID [2022-04-08 06:26:07,042 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11727#true} {12063#(< ~counter~0 49)} #86#return; {12063#(< ~counter~0 49)} is VALID [2022-04-08 06:26:07,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-08 06:26:07,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-08 06:26:07,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-08 06:26:07,042 INFO L272 TraceCheckUtils]: 42: Hoare triple {12063#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11727#true} is VALID [2022-04-08 06:26:07,042 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11727#true} {12063#(< ~counter~0 49)} #84#return; {12063#(< ~counter~0 49)} is VALID [2022-04-08 06:26:07,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-08 06:26:07,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-08 06:26:07,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-08 06:26:07,043 INFO L272 TraceCheckUtils]: 37: Hoare triple {12063#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11727#true} is VALID [2022-04-08 06:26:07,043 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11727#true} {12063#(< ~counter~0 49)} #82#return; {12063#(< ~counter~0 49)} is VALID [2022-04-08 06:26:07,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-08 06:26:07,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-08 06:26:07,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-08 06:26:07,043 INFO L272 TraceCheckUtils]: 32: Hoare triple {12063#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11727#true} is VALID [2022-04-08 06:26:07,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {12063#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {12063#(< ~counter~0 49)} is VALID [2022-04-08 06:26:07,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {12118#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12063#(< ~counter~0 49)} is VALID [2022-04-08 06:26:07,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {12118#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12118#(< ~counter~0 48)} is VALID [2022-04-08 06:26:07,045 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11727#true} {12118#(< ~counter~0 48)} #86#return; {12118#(< ~counter~0 48)} is VALID [2022-04-08 06:26:07,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-08 06:26:07,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-08 06:26:07,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-08 06:26:07,045 INFO L272 TraceCheckUtils]: 24: Hoare triple {12118#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11727#true} is VALID [2022-04-08 06:26:07,047 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11727#true} {12118#(< ~counter~0 48)} #84#return; {12118#(< ~counter~0 48)} is VALID [2022-04-08 06:26:07,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-08 06:26:07,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-08 06:26:07,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-08 06:26:07,048 INFO L272 TraceCheckUtils]: 19: Hoare triple {12118#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11727#true} is VALID [2022-04-08 06:26:07,048 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11727#true} {12118#(< ~counter~0 48)} #82#return; {12118#(< ~counter~0 48)} is VALID [2022-04-08 06:26:07,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-08 06:26:07,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-08 06:26:07,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-08 06:26:07,048 INFO L272 TraceCheckUtils]: 14: Hoare triple {12118#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11727#true} is VALID [2022-04-08 06:26:07,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {12118#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {12118#(< ~counter~0 48)} is VALID [2022-04-08 06:26:07,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {12173#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12118#(< ~counter~0 48)} is VALID [2022-04-08 06:26:07,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {12173#(< ~counter~0 47)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {12173#(< ~counter~0 47)} is VALID [2022-04-08 06:26:07,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11727#true} {12173#(< ~counter~0 47)} #80#return; {12173#(< ~counter~0 47)} is VALID [2022-04-08 06:26:07,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-08 06:26:07,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-08 06:26:07,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-08 06:26:07,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {12173#(< ~counter~0 47)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {11727#true} is VALID [2022-04-08 06:26:07,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {12173#(< ~counter~0 47)} 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 47)} is VALID [2022-04-08 06:26:07,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {12173#(< ~counter~0 47)} call #t~ret8 := main(); {12173#(< ~counter~0 47)} is VALID [2022-04-08 06:26:07,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12173#(< ~counter~0 47)} {11727#true} #96#return; {12173#(< ~counter~0 47)} is VALID [2022-04-08 06:26:07,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {12173#(< ~counter~0 47)} assume true; {12173#(< ~counter~0 47)} is VALID [2022-04-08 06:26:07,063 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 47)} is VALID [2022-04-08 06:26:07,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {11727#true} call ULTIMATE.init(); {11727#true} is VALID [2022-04-08 06:26:07,063 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-08 06:26:07,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:26:07,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756794714] [2022-04-08 06:26:07,063 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:26:07,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805286991] [2022-04-08 06:26:07,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805286991] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:26:07,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:26:07,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 06:26:07,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:26:07,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1187896023] [2022-04-08 06:26:07,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1187896023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:26:07,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:26:07,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 06:26:07,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818217693] [2022-04-08 06:26:07,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:26:07,064 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-08 06:26:07,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:26:07,065 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-08 06:26:07,106 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-08 06:26:07,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 06:26:07,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:26:07,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 06:26:07,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:26:07,107 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-08 06:26:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:26:07,603 INFO L93 Difference]: Finished difference Result 203 states and 247 transitions. [2022-04-08 06:26:07,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 06:26:07,604 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-08 06:26:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:26:07,604 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-08 06:26:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-04-08 06:26:07,605 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-08 06:26:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-04-08 06:26:07,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 111 transitions. [2022-04-08 06:26:07,701 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-08 06:26:07,703 INFO L225 Difference]: With dead ends: 203 [2022-04-08 06:26:07,703 INFO L226 Difference]: Without dead ends: 160 [2022-04-08 06:26:07,704 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-08 06:26:07,704 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 15 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:26:07,704 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.2s Time] [2022-04-08 06:26:07,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-08 06:26:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-04-08 06:26:07,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:26:07,865 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-08 06:26:07,865 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-08 06:26:07,865 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-08 06:26:07,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:26:07,868 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions. [2022-04-08 06:26:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2022-04-08 06:26:07,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:26:07,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:26:07,869 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-08 06:26:07,869 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-08 06:26:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:26:07,871 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions. [2022-04-08 06:26:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2022-04-08 06:26:07,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:26:07,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:26:07,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:26:07,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:26:07,872 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-08 06:26:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 187 transitions. [2022-04-08 06:26:07,874 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 187 transitions. Word has length 79 [2022-04-08 06:26:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:26:07,875 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 187 transitions. [2022-04-08 06:26:07,875 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-08 06:26:07,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 187 transitions. [2022-04-08 06:26:10,117 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-08 06:26:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2022-04-08 06:26:10,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 06:26:10,118 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:26:10,118 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-08 06:26:10,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 06:26:10,332 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-08 06:26:10,332 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:26:10,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:26:10,332 INFO L85 PathProgramCache]: Analyzing trace with hash 435352067, now seen corresponding path program 3 times [2022-04-08 06:26:10,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:26:10,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [422187136] [2022-04-08 06:26:17,606 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:26:17,606 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:26:17,606 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:26:17,606 INFO L85 PathProgramCache]: Analyzing trace with hash 435352067, now seen corresponding path program 4 times [2022-04-08 06:26:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:26:17,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289781209] [2022-04-08 06:26:17,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:26:17,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:26:17,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:26:17,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728313067] [2022-04-08 06:26:17,615 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:26:17,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:26:17,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:26:17,616 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-08 06:26:17,617 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-08 06:26:17,664 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:26:17,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:26:17,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:26:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:26:17,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:26:17,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {13264#true} call ULTIMATE.init(); {13264#true} is VALID [2022-04-08 06:26:17,989 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-08 06:26:17,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {13272#(<= ~counter~0 0)} assume true; {13272#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:17,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13272#(<= ~counter~0 0)} {13264#true} #96#return; {13272#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:17,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {13272#(<= ~counter~0 0)} call #t~ret8 := main(); {13272#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:17,990 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-08 06:26:17,990 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-08 06:26:17,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {13272#(<= ~counter~0 0)} ~cond := #in~cond; {13272#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:17,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {13272#(<= ~counter~0 0)} assume !(0 == ~cond); {13272#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:17,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {13272#(<= ~counter~0 0)} assume true; {13272#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:17,991 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13272#(<= ~counter~0 0)} {13272#(<= ~counter~0 0)} #80#return; {13272#(<= ~counter~0 0)} is VALID [2022-04-08 06:26:17,992 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-08 06:26:17,992 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-08 06:26:17,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {13306#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {13306#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:17,993 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-08 06:26:17,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {13306#(<= ~counter~0 1)} ~cond := #in~cond; {13306#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:17,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {13306#(<= ~counter~0 1)} assume !(0 == ~cond); {13306#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:17,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {13306#(<= ~counter~0 1)} assume true; {13306#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:17,994 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13306#(<= ~counter~0 1)} {13306#(<= ~counter~0 1)} #82#return; {13306#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:17,995 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-08 06:26:17,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {13306#(<= ~counter~0 1)} ~cond := #in~cond; {13306#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:17,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {13306#(<= ~counter~0 1)} assume !(0 == ~cond); {13306#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:17,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {13306#(<= ~counter~0 1)} assume true; {13306#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:17,996 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13306#(<= ~counter~0 1)} {13306#(<= ~counter~0 1)} #84#return; {13306#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:17,996 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-08 06:26:17,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {13306#(<= ~counter~0 1)} ~cond := #in~cond; {13306#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:17,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {13306#(<= ~counter~0 1)} assume !(0 == ~cond); {13306#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:17,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {13306#(<= ~counter~0 1)} assume true; {13306#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:17,998 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13306#(<= ~counter~0 1)} {13306#(<= ~counter~0 1)} #86#return; {13306#(<= ~counter~0 1)} is VALID [2022-04-08 06:26:17,998 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-08 06:26:17,998 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-08 06:26:17,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {13361#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:17,999 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-08 06:26:17,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {13361#(<= ~counter~0 2)} ~cond := #in~cond; {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:18,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {13361#(<= ~counter~0 2)} assume !(0 == ~cond); {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:18,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {13361#(<= ~counter~0 2)} assume true; {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:18,000 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13361#(<= ~counter~0 2)} {13361#(<= ~counter~0 2)} #82#return; {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:18,001 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-08 06:26:18,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {13361#(<= ~counter~0 2)} ~cond := #in~cond; {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:18,001 INFO L290 TraceCheckUtils]: 39: Hoare triple {13361#(<= ~counter~0 2)} assume !(0 == ~cond); {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:18,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {13361#(<= ~counter~0 2)} assume true; {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:18,002 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13361#(<= ~counter~0 2)} {13361#(<= ~counter~0 2)} #84#return; {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:18,002 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-08 06:26:18,003 INFO L290 TraceCheckUtils]: 43: Hoare triple {13361#(<= ~counter~0 2)} ~cond := #in~cond; {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:18,003 INFO L290 TraceCheckUtils]: 44: Hoare triple {13361#(<= ~counter~0 2)} assume !(0 == ~cond); {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:18,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {13361#(<= ~counter~0 2)} assume true; {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:18,004 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13361#(<= ~counter~0 2)} {13361#(<= ~counter~0 2)} #86#return; {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:18,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {13361#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {13361#(<= ~counter~0 2)} is VALID [2022-04-08 06:26:18,004 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-08 06:26:18,005 INFO L290 TraceCheckUtils]: 49: Hoare triple {13416#(<= ~counter~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {13416#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:18,005 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-08 06:26:18,006 INFO L290 TraceCheckUtils]: 51: Hoare triple {13416#(<= ~counter~0 3)} ~cond := #in~cond; {13416#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:18,006 INFO L290 TraceCheckUtils]: 52: Hoare triple {13416#(<= ~counter~0 3)} assume !(0 == ~cond); {13416#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:18,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {13416#(<= ~counter~0 3)} assume true; {13416#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:18,007 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13416#(<= ~counter~0 3)} {13416#(<= ~counter~0 3)} #88#return; {13416#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:18,007 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-08 06:26:18,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {13416#(<= ~counter~0 3)} ~cond := #in~cond; {13416#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:18,008 INFO L290 TraceCheckUtils]: 57: Hoare triple {13416#(<= ~counter~0 3)} assume !(0 == ~cond); {13416#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:18,008 INFO L290 TraceCheckUtils]: 58: Hoare triple {13416#(<= ~counter~0 3)} assume true; {13416#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:18,008 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13416#(<= ~counter~0 3)} {13416#(<= ~counter~0 3)} #90#return; {13416#(<= ~counter~0 3)} is VALID [2022-04-08 06:26:18,009 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-08 06:26:18,009 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-08 06:26:18,009 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-08 06:26:18,010 INFO L290 TraceCheckUtils]: 63: Hoare triple {13459#(<= ~counter~0 4)} assume !!(#t~post7 < 50);havoc #t~post7; {13459#(<= ~counter~0 4)} is VALID [2022-04-08 06:26:18,010 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-08 06:26:18,010 INFO L290 TraceCheckUtils]: 65: Hoare triple {13459#(<= ~counter~0 4)} ~cond := #in~cond; {13459#(<= ~counter~0 4)} is VALID [2022-04-08 06:26:18,011 INFO L290 TraceCheckUtils]: 66: Hoare triple {13459#(<= ~counter~0 4)} assume !(0 == ~cond); {13459#(<= ~counter~0 4)} is VALID [2022-04-08 06:26:18,011 INFO L290 TraceCheckUtils]: 67: Hoare triple {13459#(<= ~counter~0 4)} assume true; {13459#(<= ~counter~0 4)} is VALID [2022-04-08 06:26:18,011 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13459#(<= ~counter~0 4)} {13459#(<= ~counter~0 4)} #88#return; {13459#(<= ~counter~0 4)} is VALID [2022-04-08 06:26:18,012 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-08 06:26:18,012 INFO L290 TraceCheckUtils]: 70: Hoare triple {13459#(<= ~counter~0 4)} ~cond := #in~cond; {13459#(<= ~counter~0 4)} is VALID [2022-04-08 06:26:18,012 INFO L290 TraceCheckUtils]: 71: Hoare triple {13459#(<= ~counter~0 4)} assume !(0 == ~cond); {13459#(<= ~counter~0 4)} is VALID [2022-04-08 06:26:18,013 INFO L290 TraceCheckUtils]: 72: Hoare triple {13459#(<= ~counter~0 4)} assume true; {13459#(<= ~counter~0 4)} is VALID [2022-04-08 06:26:18,013 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13459#(<= ~counter~0 4)} {13459#(<= ~counter~0 4)} #90#return; {13459#(<= ~counter~0 4)} is VALID [2022-04-08 06:26:18,013 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-08 06:26:18,014 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-08 06:26:18,014 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-08 06:26:18,014 INFO L290 TraceCheckUtils]: 77: Hoare triple {13502#(<= |main_#t~post7| 4)} assume !(#t~post7 < 50);havoc #t~post7; {13265#false} is VALID [2022-04-08 06:26:18,015 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-08 06:26:18,015 INFO L290 TraceCheckUtils]: 79: Hoare triple {13265#false} ~cond := #in~cond; {13265#false} is VALID [2022-04-08 06:26:18,015 INFO L290 TraceCheckUtils]: 80: Hoare triple {13265#false} assume 0 == ~cond; {13265#false} is VALID [2022-04-08 06:26:18,015 INFO L290 TraceCheckUtils]: 81: Hoare triple {13265#false} assume !false; {13265#false} is VALID [2022-04-08 06:26:18,015 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-08 06:26:18,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:26:18,339 INFO L290 TraceCheckUtils]: 81: Hoare triple {13265#false} assume !false; {13265#false} is VALID [2022-04-08 06:26:18,339 INFO L290 TraceCheckUtils]: 80: Hoare triple {13265#false} assume 0 == ~cond; {13265#false} is VALID [2022-04-08 06:26:18,339 INFO L290 TraceCheckUtils]: 79: Hoare triple {13265#false} ~cond := #in~cond; {13265#false} is VALID [2022-04-08 06:26:18,339 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-08 06:26:18,339 INFO L290 TraceCheckUtils]: 77: Hoare triple {13530#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {13265#false} is VALID [2022-04-08 06:26:18,340 INFO L290 TraceCheckUtils]: 76: Hoare triple {13534#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13530#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:26:18,340 INFO L290 TraceCheckUtils]: 75: Hoare triple {13534#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13534#(< ~counter~0 50)} is VALID [2022-04-08 06:26:18,340 INFO L290 TraceCheckUtils]: 74: Hoare triple {13534#(< ~counter~0 50)} 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 50)} is VALID [2022-04-08 06:26:18,341 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13264#true} {13534#(< ~counter~0 50)} #90#return; {13534#(< ~counter~0 50)} is VALID [2022-04-08 06:26:18,341 INFO L290 TraceCheckUtils]: 72: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-08 06:26:18,341 INFO L290 TraceCheckUtils]: 71: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-08 06:26:18,341 INFO L290 TraceCheckUtils]: 70: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-08 06:26:18,341 INFO L272 TraceCheckUtils]: 69: Hoare triple {13534#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13264#true} is VALID [2022-04-08 06:26:18,342 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13264#true} {13534#(< ~counter~0 50)} #88#return; {13534#(< ~counter~0 50)} is VALID [2022-04-08 06:26:18,342 INFO L290 TraceCheckUtils]: 67: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-08 06:26:18,342 INFO L290 TraceCheckUtils]: 66: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-08 06:26:18,342 INFO L290 TraceCheckUtils]: 65: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-08 06:26:18,342 INFO L272 TraceCheckUtils]: 64: Hoare triple {13534#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {13264#true} is VALID [2022-04-08 06:26:18,342 INFO L290 TraceCheckUtils]: 63: Hoare triple {13534#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {13534#(< ~counter~0 50)} is VALID [2022-04-08 06:26:18,343 INFO L290 TraceCheckUtils]: 62: Hoare triple {13577#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13534#(< ~counter~0 50)} is VALID [2022-04-08 06:26:18,343 INFO L290 TraceCheckUtils]: 61: Hoare triple {13577#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13577#(< ~counter~0 49)} is VALID [2022-04-08 06:26:18,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {13577#(< ~counter~0 49)} 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 49)} is VALID [2022-04-08 06:26:18,344 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13264#true} {13577#(< ~counter~0 49)} #90#return; {13577#(< ~counter~0 49)} is VALID [2022-04-08 06:26:18,344 INFO L290 TraceCheckUtils]: 58: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-08 06:26:18,344 INFO L290 TraceCheckUtils]: 57: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-08 06:26:18,344 INFO L290 TraceCheckUtils]: 56: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-08 06:26:18,344 INFO L272 TraceCheckUtils]: 55: Hoare triple {13577#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13264#true} is VALID [2022-04-08 06:26:18,344 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13264#true} {13577#(< ~counter~0 49)} #88#return; {13577#(< ~counter~0 49)} is VALID [2022-04-08 06:26:18,344 INFO L290 TraceCheckUtils]: 53: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-08 06:26:18,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-08 06:26:18,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-08 06:26:18,345 INFO L272 TraceCheckUtils]: 50: Hoare triple {13577#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {13264#true} is VALID [2022-04-08 06:26:18,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {13577#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {13577#(< ~counter~0 49)} is VALID [2022-04-08 06:26:18,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {13620#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13577#(< ~counter~0 49)} is VALID [2022-04-08 06:26:18,346 INFO L290 TraceCheckUtils]: 47: Hoare triple {13620#(< ~counter~0 48)} assume !(~r~0 >= ~d~0); {13620#(< ~counter~0 48)} is VALID [2022-04-08 06:26:18,346 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13264#true} {13620#(< ~counter~0 48)} #86#return; {13620#(< ~counter~0 48)} is VALID [2022-04-08 06:26:18,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-08 06:26:18,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-08 06:26:18,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-08 06:26:18,346 INFO L272 TraceCheckUtils]: 42: Hoare triple {13620#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13264#true} is VALID [2022-04-08 06:26:18,347 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13264#true} {13620#(< ~counter~0 48)} #84#return; {13620#(< ~counter~0 48)} is VALID [2022-04-08 06:26:18,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-08 06:26:18,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-08 06:26:18,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-08 06:26:18,347 INFO L272 TraceCheckUtils]: 37: Hoare triple {13620#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13264#true} is VALID [2022-04-08 06:26:18,347 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13264#true} {13620#(< ~counter~0 48)} #82#return; {13620#(< ~counter~0 48)} is VALID [2022-04-08 06:26:18,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-08 06:26:18,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-08 06:26:18,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-08 06:26:18,348 INFO L272 TraceCheckUtils]: 32: Hoare triple {13620#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13264#true} is VALID [2022-04-08 06:26:18,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {13620#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {13620#(< ~counter~0 48)} is VALID [2022-04-08 06:26:18,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {13675#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13620#(< ~counter~0 48)} is VALID [2022-04-08 06:26:18,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {13675#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13675#(< ~counter~0 47)} is VALID [2022-04-08 06:26:18,350 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13264#true} {13675#(< ~counter~0 47)} #86#return; {13675#(< ~counter~0 47)} is VALID [2022-04-08 06:26:18,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-08 06:26:18,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-08 06:26:18,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-08 06:26:18,350 INFO L272 TraceCheckUtils]: 24: Hoare triple {13675#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13264#true} is VALID [2022-04-08 06:26:18,350 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13264#true} {13675#(< ~counter~0 47)} #84#return; {13675#(< ~counter~0 47)} is VALID [2022-04-08 06:26:18,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-08 06:26:18,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-08 06:26:18,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-08 06:26:18,351 INFO L272 TraceCheckUtils]: 19: Hoare triple {13675#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13264#true} is VALID [2022-04-08 06:26:18,351 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13264#true} {13675#(< ~counter~0 47)} #82#return; {13675#(< ~counter~0 47)} is VALID [2022-04-08 06:26:18,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-08 06:26:18,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-08 06:26:18,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-08 06:26:18,351 INFO L272 TraceCheckUtils]: 14: Hoare triple {13675#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13264#true} is VALID [2022-04-08 06:26:18,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {13675#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {13675#(< ~counter~0 47)} is VALID [2022-04-08 06:26:18,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {13730#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13675#(< ~counter~0 47)} is VALID [2022-04-08 06:26:18,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {13730#(< ~counter~0 46)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {13730#(< ~counter~0 46)} is VALID [2022-04-08 06:26:18,353 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13264#true} {13730#(< ~counter~0 46)} #80#return; {13730#(< ~counter~0 46)} is VALID [2022-04-08 06:26:18,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-08 06:26:18,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-08 06:26:18,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-08 06:26:18,353 INFO L272 TraceCheckUtils]: 6: Hoare triple {13730#(< ~counter~0 46)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {13264#true} is VALID [2022-04-08 06:26:18,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {13730#(< ~counter~0 46)} 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 46)} is VALID [2022-04-08 06:26:18,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {13730#(< ~counter~0 46)} call #t~ret8 := main(); {13730#(< ~counter~0 46)} is VALID [2022-04-08 06:26:18,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13730#(< ~counter~0 46)} {13264#true} #96#return; {13730#(< ~counter~0 46)} is VALID [2022-04-08 06:26:18,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {13730#(< ~counter~0 46)} assume true; {13730#(< ~counter~0 46)} is VALID [2022-04-08 06:26:18,355 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 46)} is VALID [2022-04-08 06:26:18,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {13264#true} call ULTIMATE.init(); {13264#true} is VALID [2022-04-08 06:26:18,355 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-08 06:26:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:26:18,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289781209] [2022-04-08 06:26:18,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:26:18,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728313067] [2022-04-08 06:26:18,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728313067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:26:18,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:26:18,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 06:26:18,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:26:18,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [422187136] [2022-04-08 06:26:18,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [422187136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:26:18,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:26:18,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:26:18,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404518931] [2022-04-08 06:26:18,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:26:18,357 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-08 06:26:18,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:26:18,357 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-08 06:26:18,416 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-08 06:26:18,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:26:18,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:26:18,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:26:18,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:26:18,417 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-08 06:26:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:26:19,032 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2022-04-08 06:26:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 06:26:19,032 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-08 06:26:19,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:26:19,032 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-08 06:26:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2022-04-08 06:26:19,035 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-08 06:26:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2022-04-08 06:26:19,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 128 transitions. [2022-04-08 06:26:19,182 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-08 06:26:19,195 INFO L225 Difference]: With dead ends: 226 [2022-04-08 06:26:19,195 INFO L226 Difference]: Without dead ends: 211 [2022-04-08 06:26:19,196 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-08 06:26:19,196 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:26:19,196 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.1s Time] [2022-04-08 06:26:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-04-08 06:26:19,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2022-04-08 06:26:19,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:26:19,413 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-08 06:26:19,413 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-08 06:26:19,413 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-08 06:26:19,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:26:19,419 INFO L93 Difference]: Finished difference Result 211 states and 242 transitions. [2022-04-08 06:26:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 242 transitions. [2022-04-08 06:26:19,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:26:19,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:26:19,421 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-08 06:26:19,421 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-08 06:26:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:26:19,424 INFO L93 Difference]: Finished difference Result 211 states and 242 transitions. [2022-04-08 06:26:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 242 transitions. [2022-04-08 06:26:19,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:26:19,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:26:19,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:26:19,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:26:19,425 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-08 06:26:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 240 transitions. [2022-04-08 06:26:19,428 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 240 transitions. Word has length 82 [2022-04-08 06:26:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:26:19,428 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 240 transitions. [2022-04-08 06:26:19,428 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-08 06:26:19,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 208 states and 240 transitions. [2022-04-08 06:26:21,731 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-08 06:26:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 240 transitions. [2022-04-08 06:26:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 06:26:21,732 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:26:21,732 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-08 06:26:21,748 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-08 06:26:21,947 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-08 06:26:21,947 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:26:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:26:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash 437079945, now seen corresponding path program 5 times [2022-04-08 06:26:21,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:26:21,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1569032839] [2022-04-08 06:26:28,215 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:26:28,216 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:26:28,216 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:26:28,216 INFO L85 PathProgramCache]: Analyzing trace with hash 437079945, now seen corresponding path program 6 times [2022-04-08 06:26:28,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:26:28,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38909935] [2022-04-08 06:26:28,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:26:28,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:26:28,225 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:26:28,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204532868] [2022-04-08 06:26:28,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:26:28,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:26:28,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:26:28,226 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-08 06:26:28,227 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-08 06:26:28,282 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 06:26:28,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:26:28,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 06:26:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:26:28,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:26:28,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {15063#true} call ULTIMATE.init(); {15063#true} is VALID [2022-04-08 06:26:28,439 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-08 06:26:28,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15063#true} {15063#true} #96#return; {15063#true} is VALID [2022-04-08 06:26:28,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {15063#true} call #t~ret8 := main(); {15063#true} is VALID [2022-04-08 06:26:28,439 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-08 06:26:28,439 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-08 06:26:28,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,439 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15063#true} {15063#true} #80#return; {15063#true} is VALID [2022-04-08 06:26:28,440 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-08 06:26:28,440 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-08 06:26:28,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {15101#(= main_~p~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,440 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-08 06:26:28,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,441 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #82#return; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,441 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-08 06:26:28,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,442 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #84#return; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,442 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-08 06:26:28,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,443 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #86#return; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,443 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-08 06:26:28,443 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-08 06:26:28,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {15156#(= main_~p~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {15156#(= main_~p~0 2)} is VALID [2022-04-08 06:26:28,444 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-08 06:26:28,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,444 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {15063#true} {15156#(= main_~p~0 2)} #82#return; {15156#(= main_~p~0 2)} is VALID [2022-04-08 06:26:28,445 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-08 06:26:28,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,445 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15063#true} {15156#(= main_~p~0 2)} #84#return; {15156#(= main_~p~0 2)} is VALID [2022-04-08 06:26:28,445 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-08 06:26:28,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,446 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15063#true} {15156#(= main_~p~0 2)} #86#return; {15156#(= main_~p~0 2)} is VALID [2022-04-08 06:26:28,446 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-08 06:26:28,447 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-08 06:26:28,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {15156#(= main_~p~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {15156#(= main_~p~0 2)} is VALID [2022-04-08 06:26:28,447 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-08 06:26:28,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,447 INFO L290 TraceCheckUtils]: 53: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,448 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15063#true} {15156#(= main_~p~0 2)} #88#return; {15156#(= main_~p~0 2)} is VALID [2022-04-08 06:26:28,448 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-08 06:26:28,448 INFO L290 TraceCheckUtils]: 56: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,448 INFO L290 TraceCheckUtils]: 57: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,448 INFO L290 TraceCheckUtils]: 58: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,449 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15063#true} {15156#(= main_~p~0 2)} #90#return; {15156#(= main_~p~0 2)} is VALID [2022-04-08 06:26:28,449 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-08 06:26:28,449 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-08 06:26:28,450 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-08 06:26:28,450 INFO L290 TraceCheckUtils]: 63: Hoare triple {15101#(= main_~p~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,450 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-08 06:26:28,450 INFO L290 TraceCheckUtils]: 65: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,450 INFO L290 TraceCheckUtils]: 66: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,450 INFO L290 TraceCheckUtils]: 67: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,451 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #88#return; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,451 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-08 06:26:28,451 INFO L290 TraceCheckUtils]: 70: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,451 INFO L290 TraceCheckUtils]: 71: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,451 INFO L290 TraceCheckUtils]: 72: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,452 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #90#return; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,452 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-08 06:26:28,452 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-08 06:26:28,452 INFO L290 TraceCheckUtils]: 76: Hoare triple {15064#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15064#false} is VALID [2022-04-08 06:26:28,452 INFO L290 TraceCheckUtils]: 77: Hoare triple {15064#false} assume !!(#t~post7 < 50);havoc #t~post7; {15064#false} is VALID [2022-04-08 06:26:28,452 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-08 06:26:28,452 INFO L290 TraceCheckUtils]: 79: Hoare triple {15064#false} ~cond := #in~cond; {15064#false} is VALID [2022-04-08 06:26:28,452 INFO L290 TraceCheckUtils]: 80: Hoare triple {15064#false} assume 0 == ~cond; {15064#false} is VALID [2022-04-08 06:26:28,452 INFO L290 TraceCheckUtils]: 81: Hoare triple {15064#false} assume !false; {15064#false} is VALID [2022-04-08 06:26:28,453 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-08 06:26:28,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:26:28,680 INFO L290 TraceCheckUtils]: 81: Hoare triple {15064#false} assume !false; {15064#false} is VALID [2022-04-08 06:26:28,680 INFO L290 TraceCheckUtils]: 80: Hoare triple {15064#false} assume 0 == ~cond; {15064#false} is VALID [2022-04-08 06:26:28,681 INFO L290 TraceCheckUtils]: 79: Hoare triple {15064#false} ~cond := #in~cond; {15064#false} is VALID [2022-04-08 06:26:28,681 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-08 06:26:28,681 INFO L290 TraceCheckUtils]: 77: Hoare triple {15064#false} assume !!(#t~post7 < 50);havoc #t~post7; {15064#false} is VALID [2022-04-08 06:26:28,681 INFO L290 TraceCheckUtils]: 76: Hoare triple {15064#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15064#false} is VALID [2022-04-08 06:26:28,681 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-08 06:26:28,681 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-08 06:26:28,682 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #90#return; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,682 INFO L290 TraceCheckUtils]: 72: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,682 INFO L290 TraceCheckUtils]: 71: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,682 INFO L290 TraceCheckUtils]: 70: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,682 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-08 06:26:28,682 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #88#return; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,682 INFO L290 TraceCheckUtils]: 67: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,683 INFO L290 TraceCheckUtils]: 66: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,683 INFO L290 TraceCheckUtils]: 65: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,683 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-08 06:26:28,683 INFO L290 TraceCheckUtils]: 63: Hoare triple {15101#(= main_~p~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,683 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-08 06:26:28,683 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-08 06:26:28,684 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-08 06:26:28,685 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-08 06:26:28,685 INFO L290 TraceCheckUtils]: 58: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,685 INFO L290 TraceCheckUtils]: 57: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,685 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-08 06:26:28,686 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-08 06:26:28,686 INFO L290 TraceCheckUtils]: 53: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,686 INFO L290 TraceCheckUtils]: 52: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,686 INFO L290 TraceCheckUtils]: 51: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,686 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-08 06:26:28,686 INFO L290 TraceCheckUtils]: 49: Hoare triple {15376#(= (div main_~p~0 2) 1)} assume !!(#t~post7 < 50);havoc #t~post7; {15376#(= (div main_~p~0 2) 1)} is VALID [2022-04-08 06:26:28,686 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-08 06:26:28,687 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-08 06:26:28,687 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-08 06:26:28,687 INFO L290 TraceCheckUtils]: 45: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,687 INFO L290 TraceCheckUtils]: 43: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,687 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-08 06:26:28,688 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-08 06:26:28,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,688 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-08 06:26:28,688 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-08 06:26:28,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,689 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-08 06:26:28,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {15376#(= (div main_~p~0 2) 1)} assume !!(#t~post6 < 50);havoc #t~post6; {15376#(= (div main_~p~0 2) 1)} is VALID [2022-04-08 06:26:28,689 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-08 06:26:28,690 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-08 06:26:28,690 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #86#return; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,690 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-08 06:26:28,691 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #84#return; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,691 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-08 06:26:28,691 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #82#return; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,692 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-08 06:26:28,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {15101#(= main_~p~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {15101#(= main_~p~0 1)} is VALID [2022-04-08 06:26:28,692 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-08 06:26:28,693 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-08 06:26:28,693 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15063#true} {15063#true} #80#return; {15063#true} is VALID [2022-04-08 06:26:28,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-08 06:26:28,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-08 06:26:28,693 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-08 06:26:28,693 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-08 06:26:28,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {15063#true} call #t~ret8 := main(); {15063#true} is VALID [2022-04-08 06:26:28,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15063#true} {15063#true} #96#return; {15063#true} is VALID [2022-04-08 06:26:28,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-08 06:26:28,693 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-08 06:26:28,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {15063#true} call ULTIMATE.init(); {15063#true} is VALID [2022-04-08 06:26:28,694 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-08 06:26:28,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:26:28,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38909935] [2022-04-08 06:26:28,694 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:26:28,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204532868] [2022-04-08 06:26:28,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204532868] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:26:28,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:26:28,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2022-04-08 06:26:28,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:26:28,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1569032839] [2022-04-08 06:26:28,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1569032839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:26:28,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:26:28,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:26:28,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569410045] [2022-04-08 06:26:28,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:26:28,695 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-08 06:26:28,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:26:28,695 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-08 06:26:28,742 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-08 06:26:28,742 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:26:28,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:26:28,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:26:28,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:26:28,743 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-08 06:26:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:26:29,096 INFO L93 Difference]: Finished difference Result 225 states and 264 transitions. [2022-04-08 06:26:29,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:26:29,096 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-08 06:26:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:26:29,097 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-08 06:26:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 06:26:29,098 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-08 06:26:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 06:26:29,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-08 06:26:29,176 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-08 06:26:29,179 INFO L225 Difference]: With dead ends: 225 [2022-04-08 06:26:29,179 INFO L226 Difference]: Without dead ends: 196 [2022-04-08 06:26:29,179 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-08 06:26:29,179 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-08 06:26:29,180 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-08 06:26:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-08 06:26:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2022-04-08 06:26:29,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:26:29,389 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-08 06:26:29,389 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-08 06:26:29,390 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-08 06:26:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:26:29,393 INFO L93 Difference]: Finished difference Result 196 states and 224 transitions. [2022-04-08 06:26:29,393 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 224 transitions. [2022-04-08 06:26:29,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:26:29,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:26:29,393 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-08 06:26:29,394 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-08 06:26:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:26:29,396 INFO L93 Difference]: Finished difference Result 196 states and 224 transitions. [2022-04-08 06:26:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 224 transitions. [2022-04-08 06:26:29,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:26:29,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:26:29,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:26:29,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:26:29,397 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-08 06:26:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 219 transitions. [2022-04-08 06:26:29,400 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 219 transitions. Word has length 82 [2022-04-08 06:26:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:26:29,401 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 219 transitions. [2022-04-08 06:26:29,401 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-08 06:26:29,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 219 transitions. [2022-04-08 06:26:31,719 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-08 06:26:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 219 transitions. [2022-04-08 06:26:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 06:26:31,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:26:31,728 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-08 06:26:31,743 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-08 06:26:31,936 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-08 06:26:31,936 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:26:31,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:26:31,937 INFO L85 PathProgramCache]: Analyzing trace with hash 111833757, now seen corresponding path program 1 times [2022-04-08 06:26:31,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:26:31,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1359411142] [2022-04-08 06:26:40,537 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:26:40,537 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:26:40,537 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:26:40,537 INFO L85 PathProgramCache]: Analyzing trace with hash 111833757, now seen corresponding path program 2 times [2022-04-08 06:26:40,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:26:40,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095940680] [2022-04-08 06:26:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:26:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:26:40,549 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:26:40,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446401093] [2022-04-08 06:26:40,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:26:40,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:26:40,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:26:40,564 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-08 06:26:40,564 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-08 06:26:40,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:26:40,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:26:40,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 06:26:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:26:40,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:26:41,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {16787#true} call ULTIMATE.init(); {16787#true} is VALID [2022-04-08 06:26:41,531 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-08 06:26:41,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:41,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16787#true} {16787#true} #96#return; {16787#true} is VALID [2022-04-08 06:26:41,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {16787#true} call #t~ret8 := main(); {16787#true} is VALID [2022-04-08 06:26:41,531 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-08 06:26:41,531 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-08 06:26:41,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:41,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:41,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:41,531 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16787#true} {16787#true} #80#return; {16787#true} is VALID [2022-04-08 06:26:41,532 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-08 06:26:41,532 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-08 06:26:41,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} assume !!(#t~post6 < 50);havoc #t~post6; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-08 06:26:41,532 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-08 06:26:41,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:41,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:41,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:41,533 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-08 06:26:41,533 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-08 06:26:41,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:41,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:41,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:41,534 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-08 06:26:41,534 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-08 06:26:41,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:41,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:41,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:41,534 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-08 06:26:41,535 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-08 06:26:41,535 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-08 06:26:41,536 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 < 50);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-08 06:26:41,536 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-08 06:26:41,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:41,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:41,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:41,536 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-08 06:26:41,537 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-08 06:26:41,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:41,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:41,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:41,537 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-08 06:26:41,537 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-08 06:26:41,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:41,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:41,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:41,538 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-08 06:26:41,539 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-08 06:26:41,540 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-08 06:26:41,540 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 < 50);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-08 06:26:41,540 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-08 06:26:41,540 INFO L290 TraceCheckUtils]: 51: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:41,540 INFO L290 TraceCheckUtils]: 52: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:41,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:41,541 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-08 06:26:41,541 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-08 06:26:41,541 INFO L290 TraceCheckUtils]: 56: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:41,541 INFO L290 TraceCheckUtils]: 57: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:41,541 INFO L290 TraceCheckUtils]: 58: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:41,541 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-08 06:26:41,543 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-08 06:26:41,543 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-08 06:26:41,543 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-08 06:26:41,544 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 < 50);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-08 06:26:41,544 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-08 06:26:41,544 INFO L290 TraceCheckUtils]: 65: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:41,544 INFO L290 TraceCheckUtils]: 66: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:41,544 INFO L290 TraceCheckUtils]: 67: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:41,544 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-08 06:26:41,545 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-08 06:26:41,545 INFO L290 TraceCheckUtils]: 70: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:41,545 INFO L290 TraceCheckUtils]: 71: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:41,545 INFO L290 TraceCheckUtils]: 72: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:41,545 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-08 06:26:41,545 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-08 06:26:41,546 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-08 06:26:41,546 INFO L290 TraceCheckUtils]: 76: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:41,546 INFO L290 TraceCheckUtils]: 77: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:41,546 INFO L290 TraceCheckUtils]: 78: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:41,547 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-08 06:26:41,547 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-08 06:26:41,547 INFO L290 TraceCheckUtils]: 81: Hoare triple {17036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:26:41,548 INFO L290 TraceCheckUtils]: 82: Hoare triple {17040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16788#false} is VALID [2022-04-08 06:26:41,548 INFO L290 TraceCheckUtils]: 83: Hoare triple {16788#false} assume !false; {16788#false} is VALID [2022-04-08 06:26:41,548 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-08 06:26:41,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:26:42,119 INFO L290 TraceCheckUtils]: 83: Hoare triple {16788#false} assume !false; {16788#false} is VALID [2022-04-08 06:26:42,120 INFO L290 TraceCheckUtils]: 82: Hoare triple {17040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16788#false} is VALID [2022-04-08 06:26:42,120 INFO L290 TraceCheckUtils]: 81: Hoare triple {17036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:26:42,120 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-08 06:26:42,121 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-08 06:26:42,121 INFO L290 TraceCheckUtils]: 78: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:42,121 INFO L290 TraceCheckUtils]: 77: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:42,121 INFO L290 TraceCheckUtils]: 76: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:42,121 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-08 06:26:42,121 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-08 06:26:42,122 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-08 06:26:42,122 INFO L290 TraceCheckUtils]: 72: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:42,122 INFO L290 TraceCheckUtils]: 71: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:42,122 INFO L290 TraceCheckUtils]: 70: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:42,122 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-08 06:26:42,123 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-08 06:26:42,123 INFO L290 TraceCheckUtils]: 67: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:42,123 INFO L290 TraceCheckUtils]: 66: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:42,123 INFO L290 TraceCheckUtils]: 65: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:42,123 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-08 06:26:42,123 INFO L290 TraceCheckUtils]: 63: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} assume !!(#t~post7 < 50);havoc #t~post7; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-08 06:26:42,123 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-08 06:26:42,124 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-08 06:26:42,125 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-08 06:26:42,126 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-08 06:26:42,126 INFO L290 TraceCheckUtils]: 58: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:42,126 INFO L290 TraceCheckUtils]: 57: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:42,126 INFO L290 TraceCheckUtils]: 56: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:42,126 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-08 06:26:42,127 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-08 06:26:42,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:42,127 INFO L290 TraceCheckUtils]: 52: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:42,127 INFO L290 TraceCheckUtils]: 51: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:42,127 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-08 06:26:42,128 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 < 50);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-08 06:26:42,129 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-08 06:26:42,129 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-08 06:26:42,130 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-08 06:26:42,130 INFO L290 TraceCheckUtils]: 45: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:42,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:42,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:42,130 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-08 06:26:42,131 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-08 06:26:42,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:42,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:42,131 INFO L290 TraceCheckUtils]: 38: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:42,131 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-08 06:26:42,131 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-08 06:26:42,131 INFO L290 TraceCheckUtils]: 35: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:42,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:42,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:42,132 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-08 06:26:42,132 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 < 50);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-08 06:26:42,133 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-08 06:26:42,134 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-08 06:26:42,135 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-08 06:26:42,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:42,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:42,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:42,135 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-08 06:26:42,135 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-08 06:26:42,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:42,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:42,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:42,136 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-08 06:26:42,136 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-08 06:26:42,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:42,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:42,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:42,136 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-08 06:26:42,137 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 < 50);havoc #t~post6; {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-08 06:26:42,137 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-08 06:26:42,137 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-08 06:26:42,138 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16787#true} {16787#true} #80#return; {16787#true} is VALID [2022-04-08 06:26:42,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:42,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-08 06:26:42,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-08 06:26:42,138 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-08 06:26:42,138 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-08 06:26:42,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {16787#true} call #t~ret8 := main(); {16787#true} is VALID [2022-04-08 06:26:42,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16787#true} {16787#true} #96#return; {16787#true} is VALID [2022-04-08 06:26:42,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-08 06:26:42,138 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-08 06:26:42,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {16787#true} call ULTIMATE.init(); {16787#true} is VALID [2022-04-08 06:26:42,139 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-08 06:26:42,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:26:42,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095940680] [2022-04-08 06:26:42,139 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:26:42,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446401093] [2022-04-08 06:26:42,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446401093] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:26:42,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:26:42,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-08 06:26:42,139 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:26:42,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1359411142] [2022-04-08 06:26:42,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1359411142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:26:42,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:26:42,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:26:42,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222141333] [2022-04-08 06:26:42,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:26:42,140 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-08 06:26:42,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:26:42,140 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-08 06:26:42,198 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-08 06:26:42,199 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:26:42,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:26:42,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:26:42,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 06:26:42,199 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-08 06:26:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:26:43,235 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2022-04-08 06:26:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:26:43,235 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-08 06:26:43,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:26:43,235 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-08 06:26:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-08 06:26:43,236 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-08 06:26:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-08 06:26:43,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-08 06:26:43,321 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-08 06:26:43,323 INFO L225 Difference]: With dead ends: 198 [2022-04-08 06:26:43,323 INFO L226 Difference]: Without dead ends: 161 [2022-04-08 06:26:43,324 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-08 06:26:43,324 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:26:43,324 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.3s Time] [2022-04-08 06:26:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-08 06:26:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-04-08 06:26:43,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:26:43,469 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-08 06:26:43,469 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-08 06:26:43,469 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-08 06:26:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:26:43,471 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2022-04-08 06:26:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2022-04-08 06:26:43,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:26:43,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:26:43,472 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-08 06:26:43,472 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-08 06:26:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:26:43,474 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2022-04-08 06:26:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2022-04-08 06:26:43,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:26:43,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:26:43,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:26:43,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:26:43,476 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-08 06:26:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2022-04-08 06:26:43,478 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 84 [2022-04-08 06:26:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:26:43,478 INFO L478 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2022-04-08 06:26:43,479 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-08 06:26:43,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 161 states and 186 transitions. [2022-04-08 06:26:45,714 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-08 06:26:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2022-04-08 06:26:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 06:26:45,715 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:26:45,715 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-08 06:26:45,730 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-08 06:26:45,923 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-08 06:26:45,923 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:26:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:26:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1068167297, now seen corresponding path program 7 times [2022-04-08 06:26:45,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:26:45,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [915500981] [2022-04-08 06:26:54,745 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:26:54,746 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:26:54,746 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:26:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1068167297, now seen corresponding path program 8 times [2022-04-08 06:26:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:26:54,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530892918] [2022-04-08 06:26:54,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:26:54,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:26:54,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:26:54,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672666434] [2022-04-08 06:26:54,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:26:54,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:26:54,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:26:54,757 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-08 06:26:54,758 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-08 06:26:54,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:26:54,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:26:54,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 06:26:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:26:54,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:26:58,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {18345#true} call ULTIMATE.init(); {18345#true} is VALID [2022-04-08 06:26:58,565 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-08 06:26:58,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:26:58,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18345#true} {18345#true} #96#return; {18345#true} is VALID [2022-04-08 06:26:58,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {18345#true} call #t~ret8 := main(); {18345#true} is VALID [2022-04-08 06:26:58,566 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-08 06:26:58,566 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-08 06:26:58,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:26:58,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:26:58,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:26:58,566 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18345#true} {18345#true} #80#return; {18345#true} is VALID [2022-04-08 06:26:58,566 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-08 06:26:58,567 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-08 06:26:58,567 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 < 50);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-08 06:26:58,567 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-08 06:26:58,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:26:58,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:26:58,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:26:58,568 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-08 06:26:58,568 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-08 06:26:58,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:26:58,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:26:58,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:26:58,569 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-08 06:26:58,569 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-08 06:26:58,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:26:58,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:26:58,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:26:58,569 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-08 06:26:58,571 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-08 06:26:58,571 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-08 06:26:58,571 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 < 50);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-08 06:26:58,571 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-08 06:26:58,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:26:58,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:26:58,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:26:58,572 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-08 06:26:58,572 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-08 06:26:58,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:26:58,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:26:58,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:26:58,573 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-08 06:26:58,573 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-08 06:26:58,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:26:58,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:26:58,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:26:58,574 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-08 06:26:58,575 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-08 06:26:58,575 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-08 06:26:58,575 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 < 50);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-08 06:26:58,575 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-08 06:26:58,576 INFO L290 TraceCheckUtils]: 51: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:26:58,576 INFO L290 TraceCheckUtils]: 52: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:26:58,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:26:58,576 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-08 06:26:58,576 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-08 06:26:58,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:26:58,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:26:58,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:26:58,577 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-08 06:26:58,577 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-08 06:26:58,577 INFO L290 TraceCheckUtils]: 61: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:26:58,577 INFO L290 TraceCheckUtils]: 62: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:26:58,577 INFO L290 TraceCheckUtils]: 63: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:26:58,578 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-08 06:26:58,578 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-08 06:26:58,579 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-08 06:26:58,579 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 < 50);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-08 06:26:58,579 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-08 06:26:58,579 INFO L290 TraceCheckUtils]: 69: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:26:58,579 INFO L290 TraceCheckUtils]: 70: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:26:58,579 INFO L290 TraceCheckUtils]: 71: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:26:58,580 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-08 06:26:58,580 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-08 06:26:58,580 INFO L290 TraceCheckUtils]: 74: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:26:58,580 INFO L290 TraceCheckUtils]: 75: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:26:58,580 INFO L290 TraceCheckUtils]: 76: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:26:58,580 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-08 06:26:58,581 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-08 06:26:58,583 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-08 06:26:58,583 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-08 06:26:58,584 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 < 50);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-08 06:26:58,584 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-08 06:26:58,585 INFO L290 TraceCheckUtils]: 83: Hoare triple {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:26:58,585 INFO L290 TraceCheckUtils]: 84: Hoare triple {18606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18346#false} is VALID [2022-04-08 06:26:58,585 INFO L290 TraceCheckUtils]: 85: Hoare triple {18346#false} assume !false; {18346#false} is VALID [2022-04-08 06:26:58,586 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-08 06:26:58,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:27:06,508 INFO L290 TraceCheckUtils]: 85: Hoare triple {18346#false} assume !false; {18346#false} is VALID [2022-04-08 06:27:06,509 INFO L290 TraceCheckUtils]: 84: Hoare triple {18606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18346#false} is VALID [2022-04-08 06:27:06,510 INFO L290 TraceCheckUtils]: 83: Hoare triple {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:27:06,510 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-08 06:27:06,510 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 < 50);havoc #t~post7; {18622#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:27:06,511 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-08 06:27:06,513 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-08 06:27:06,528 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-08 06:27:06,529 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-08 06:27:06,529 INFO L290 TraceCheckUtils]: 76: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:27:06,529 INFO L290 TraceCheckUtils]: 75: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:27:06,529 INFO L290 TraceCheckUtils]: 74: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:27:06,529 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-08 06:27:06,529 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-08 06:27:06,529 INFO L290 TraceCheckUtils]: 71: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:27:06,530 INFO L290 TraceCheckUtils]: 70: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:27:06,530 INFO L290 TraceCheckUtils]: 69: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:27:06,530 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-08 06:27:06,531 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 < 50);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-08 06:27:06,532 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-08 06:27:06,533 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-08 06:27:06,533 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-08 06:27:06,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:27:06,534 INFO L290 TraceCheckUtils]: 62: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:27:06,534 INFO L290 TraceCheckUtils]: 61: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:27:06,534 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-08 06:27:06,534 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-08 06:27:06,534 INFO L290 TraceCheckUtils]: 58: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:27:06,534 INFO L290 TraceCheckUtils]: 57: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:27:06,534 INFO L290 TraceCheckUtils]: 56: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:27:06,535 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-08 06:27:06,535 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-08 06:27:06,535 INFO L290 TraceCheckUtils]: 53: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:27:06,535 INFO L290 TraceCheckUtils]: 52: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:27:06,535 INFO L290 TraceCheckUtils]: 51: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:27:06,535 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-08 06:27:06,536 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 < 50);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-08 06:27:06,537 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-08 06:27:06,541 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-08 06:27:06,542 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-08 06:27:06,542 INFO L290 TraceCheckUtils]: 45: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:27:06,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:27:06,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:27:06,542 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-08 06:27:06,543 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-08 06:27:06,543 INFO L290 TraceCheckUtils]: 40: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:27:06,543 INFO L290 TraceCheckUtils]: 39: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:27:06,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:27:06,543 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-08 06:27:06,543 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-08 06:27:06,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:27:06,544 INFO L290 TraceCheckUtils]: 34: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:27:06,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:27:06,544 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-08 06:27:06,544 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 < 50);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-08 06:27:06,545 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-08 06:27:06,546 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-08 06:27:06,547 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-08 06:27:06,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:27:06,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:27:06,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:27:06,547 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-08 06:27:06,547 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-08 06:27:06,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:27:06,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:27:06,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:27:06,548 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-08 06:27:06,548 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-08 06:27:06,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:27:06,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:27:06,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:27:06,549 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-08 06:27:06,549 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 < 50);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-08 06:27:06,549 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-08 06:27:06,551 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-08 06:27:06,551 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18345#true} {18345#true} #80#return; {18345#true} is VALID [2022-04-08 06:27:06,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:27:06,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-08 06:27:06,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-08 06:27:06,551 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-08 06:27:06,551 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-08 06:27:06,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {18345#true} call #t~ret8 := main(); {18345#true} is VALID [2022-04-08 06:27:06,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18345#true} {18345#true} #96#return; {18345#true} is VALID [2022-04-08 06:27:06,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-08 06:27:06,552 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-08 06:27:06,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {18345#true} call ULTIMATE.init(); {18345#true} is VALID [2022-04-08 06:27:06,552 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-08 06:27:06,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:27:06,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530892918] [2022-04-08 06:27:06,553 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:27:06,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672666434] [2022-04-08 06:27:06,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672666434] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:27:06,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:27:06,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-08 06:27:06,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:27:06,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [915500981] [2022-04-08 06:27:06,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [915500981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:27:06,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:27:06,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 06:27:06,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333143588] [2022-04-08 06:27:06,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:27:06,554 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-08 06:27:06,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:27:06,554 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-08 06:27:06,614 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-08 06:27:06,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 06:27:06,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:27:06,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 06:27:06,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-04-08 06:27:06,615 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-08 06:27:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:27:08,614 INFO L93 Difference]: Finished difference Result 220 states and 267 transitions. [2022-04-08 06:27:08,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 06:27:08,614 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-08 06:27:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:27:08,614 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-08 06:27:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-08 06:27:08,616 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-08 06:27:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-08 06:27:08,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-08 06:27:08,752 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-08 06:27:08,754 INFO L225 Difference]: With dead ends: 220 [2022-04-08 06:27:08,754 INFO L226 Difference]: Without dead ends: 175 [2022-04-08 06:27:08,754 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-04-08 06:27:08,755 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 12 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 06:27:08,755 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 276 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 06:27:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-08 06:27:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-04-08 06:27:08,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:27:08,927 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-08 06:27:08,928 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-08 06:27:08,928 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-08 06:27:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:27:08,930 INFO L93 Difference]: Finished difference Result 175 states and 205 transitions. [2022-04-08 06:27:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 205 transitions. [2022-04-08 06:27:08,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:27:08,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:27:08,931 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-08 06:27:08,931 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-08 06:27:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:27:08,934 INFO L93 Difference]: Finished difference Result 175 states and 205 transitions. [2022-04-08 06:27:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 205 transitions. [2022-04-08 06:27:08,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:27:08,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:27:08,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:27:08,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:27:08,934 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-08 06:27:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 200 transitions. [2022-04-08 06:27:08,937 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 200 transitions. Word has length 86 [2022-04-08 06:27:08,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:27:08,937 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 200 transitions. [2022-04-08 06:27:08,938 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-08 06:27:08,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 200 transitions. [2022-04-08 06:27:11,219 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-08 06:27:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 200 transitions. [2022-04-08 06:27:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 06:27:11,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:27:11,220 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-08 06:27:11,238 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-08 06:27:11,427 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-08 06:27:11,428 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:27:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:27:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1271087930, now seen corresponding path program 9 times [2022-04-08 06:27:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:27:11,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [219172337] [2022-04-08 06:27:21,020 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:27:21,020 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:27:21,021 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:27:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1271087930, now seen corresponding path program 10 times [2022-04-08 06:27:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:27:21,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606400809] [2022-04-08 06:27:21,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:27:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:27:21,029 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:27:21,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127009864] [2022-04-08 06:27:21,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:27:21,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:27:21,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:27:21,030 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-08 06:27:21,036 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-08 06:27:21,126 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:27:21,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:27:21,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 06:27:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:27:21,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:27:22,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {20012#true} call ULTIMATE.init(); {20012#true} is VALID [2022-04-08 06:27:22,159 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-08 06:27:22,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20012#true} {20012#true} #96#return; {20012#true} is VALID [2022-04-08 06:27:22,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {20012#true} call #t~ret8 := main(); {20012#true} is VALID [2022-04-08 06:27:22,160 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-08 06:27:22,160 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-08 06:27:22,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:22,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:22,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,160 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20012#true} {20012#true} #80#return; {20012#true} is VALID [2022-04-08 06:27:22,160 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-08 06:27:22,161 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-08 06:27:22,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-08 06:27:22,161 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-08 06:27:22,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:22,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:22,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,164 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-08 06:27:22,164 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-08 06:27:22,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:22,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:22,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,168 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-08 06:27:22,168 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-08 06:27:22,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:22,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:22,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,169 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-08 06:27:22,170 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-08 06:27:22,171 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-08 06:27:22,171 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 < 50);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-08 06:27:22,171 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-08 06:27:22,171 INFO L290 TraceCheckUtils]: 33: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:22,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:22,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,172 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-08 06:27:22,172 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-08 06:27:22,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:22,172 INFO L290 TraceCheckUtils]: 39: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:22,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,172 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-08 06:27:22,172 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-08 06:27:22,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:22,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:22,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,173 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-08 06:27:22,174 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-08 06:27:22,175 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-08 06:27:22,175 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 < 50);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-08 06:27:22,175 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-08 06:27:22,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:22,175 INFO L290 TraceCheckUtils]: 52: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:22,175 INFO L290 TraceCheckUtils]: 53: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,176 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-08 06:27:22,176 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-08 06:27:22,176 INFO L290 TraceCheckUtils]: 56: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:22,176 INFO L290 TraceCheckUtils]: 57: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:22,176 INFO L290 TraceCheckUtils]: 58: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,177 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-08 06:27:22,177 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-08 06:27:22,177 INFO L290 TraceCheckUtils]: 61: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:22,177 INFO L290 TraceCheckUtils]: 62: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:22,177 INFO L290 TraceCheckUtils]: 63: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,177 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-08 06:27:22,178 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-08 06:27:22,178 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-08 06:27:22,179 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 < 50);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-08 06:27:22,179 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-08 06:27:22,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:22,179 INFO L290 TraceCheckUtils]: 70: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:22,179 INFO L290 TraceCheckUtils]: 71: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,180 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-08 06:27:22,180 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-08 06:27:22,180 INFO L290 TraceCheckUtils]: 74: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:22,180 INFO L290 TraceCheckUtils]: 75: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:22,180 INFO L290 TraceCheckUtils]: 76: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,180 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-08 06:27:22,181 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-08 06:27:22,182 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-08 06:27:22,182 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-08 06:27:22,182 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 < 50);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-08 06:27:22,182 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-08 06:27:22,182 INFO L290 TraceCheckUtils]: 83: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:22,183 INFO L290 TraceCheckUtils]: 84: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:22,183 INFO L290 TraceCheckUtils]: 85: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:22,183 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-08 06:27:22,184 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-08 06:27:22,184 INFO L290 TraceCheckUtils]: 88: Hoare triple {20283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:27:22,184 INFO L290 TraceCheckUtils]: 89: Hoare triple {20287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20013#false} is VALID [2022-04-08 06:27:22,184 INFO L290 TraceCheckUtils]: 90: Hoare triple {20013#false} assume !false; {20013#false} is VALID [2022-04-08 06:27:22,185 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-08 06:27:22,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:27:27,337 INFO L290 TraceCheckUtils]: 90: Hoare triple {20013#false} assume !false; {20013#false} is VALID [2022-04-08 06:27:27,338 INFO L290 TraceCheckUtils]: 89: Hoare triple {20287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20013#false} is VALID [2022-04-08 06:27:27,338 INFO L290 TraceCheckUtils]: 88: Hoare triple {20283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:27:27,338 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-08 06:27:27,339 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-08 06:27:27,339 INFO L290 TraceCheckUtils]: 85: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,339 INFO L290 TraceCheckUtils]: 84: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:27,339 INFO L290 TraceCheckUtils]: 83: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:27,339 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-08 06:27:27,339 INFO L290 TraceCheckUtils]: 81: Hoare triple {20303#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 50);havoc #t~post7; {20303#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-08 06:27:27,340 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-08 06:27:27,340 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-08 06:27:27,351 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-08 06:27:27,352 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-08 06:27:27,352 INFO L290 TraceCheckUtils]: 76: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,352 INFO L290 TraceCheckUtils]: 75: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:27,352 INFO L290 TraceCheckUtils]: 74: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:27,352 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-08 06:27:27,352 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-08 06:27:27,353 INFO L290 TraceCheckUtils]: 71: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,353 INFO L290 TraceCheckUtils]: 70: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:27,353 INFO L290 TraceCheckUtils]: 69: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:27,353 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-08 06:27:27,354 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 < 50);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-08 06:27:27,355 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-08 06:27:27,356 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-08 06:27:27,357 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-08 06:27:27,357 INFO L290 TraceCheckUtils]: 63: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,357 INFO L290 TraceCheckUtils]: 62: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:27,357 INFO L290 TraceCheckUtils]: 61: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:27,357 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-08 06:27:27,357 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-08 06:27:27,357 INFO L290 TraceCheckUtils]: 58: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:27,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:27,358 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-08 06:27:27,358 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-08 06:27:27,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,358 INFO L290 TraceCheckUtils]: 52: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:27,358 INFO L290 TraceCheckUtils]: 51: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:27,358 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-08 06:27:27,359 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 < 50);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-08 06:27:27,360 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-08 06:27:27,364 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-08 06:27:27,365 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-08 06:27:27,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:27,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:27,365 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-08 06:27:27,366 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-08 06:27:27,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:27,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:27,366 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-08 06:27:27,367 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-08 06:27:27,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:27,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:27,367 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-08 06:27:27,367 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 < 50);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-08 06:27:27,368 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-08 06:27:27,369 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-08 06:27:27,369 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-08 06:27:27,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:27,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:27,370 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-08 06:27:27,370 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-08 06:27:27,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:27,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:27,370 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-08 06:27:27,371 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-08 06:27:27,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:27,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:27,371 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-08 06:27:27,371 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 < 50);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-08 06:27:27,372 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-08 06:27:27,372 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-08 06:27:27,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20012#true} {20012#true} #80#return; {20012#true} is VALID [2022-04-08 06:27:27,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-08 06:27:27,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-08 06:27:27,373 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-08 06:27:27,373 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-08 06:27:27,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {20012#true} call #t~ret8 := main(); {20012#true} is VALID [2022-04-08 06:27:27,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20012#true} {20012#true} #96#return; {20012#true} is VALID [2022-04-08 06:27:27,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-08 06:27:27,373 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-08 06:27:27,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {20012#true} call ULTIMATE.init(); {20012#true} is VALID [2022-04-08 06:27:27,373 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-08 06:27:27,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:27:27,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606400809] [2022-04-08 06:27:27,374 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:27:27,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127009864] [2022-04-08 06:27:27,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127009864] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:27:27,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:27:27,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 06:27:27,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:27:27,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [219172337] [2022-04-08 06:27:27,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [219172337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:27:27,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:27:27,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:27:27,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405784563] [2022-04-08 06:27:27,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:27:27,375 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-08 06:27:27,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:27:27,375 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-08 06:27:27,432 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-08 06:27:27,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:27:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:27:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:27:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:27:27,433 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-08 06:27:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:27:28,990 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2022-04-08 06:27:28,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 06:27:28,990 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-08 06:27:28,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:27:28,991 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-08 06:27:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2022-04-08 06:27:28,992 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-08 06:27:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2022-04-08 06:27:28,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 123 transitions. [2022-04-08 06:27:29,120 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-08 06:27:29,122 INFO L225 Difference]: With dead ends: 212 [2022-04-08 06:27:29,122 INFO L226 Difference]: Without dead ends: 182 [2022-04-08 06:27:29,123 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-04-08 06:27:29,123 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-08 06:27:29,123 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-08 06:27:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-08 06:27:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2022-04-08 06:27:29,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:27:29,293 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-08 06:27:29,293 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-08 06:27:29,294 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-08 06:27:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:27:29,296 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2022-04-08 06:27:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2022-04-08 06:27:29,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:27:29,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:27:29,297 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-08 06:27:29,297 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-08 06:27:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:27:29,299 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2022-04-08 06:27:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2022-04-08 06:27:29,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:27:29,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:27:29,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:27:29,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:27:29,300 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-08 06:27:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 207 transitions. [2022-04-08 06:27:29,303 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 207 transitions. Word has length 91 [2022-04-08 06:27:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:27:29,303 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 207 transitions. [2022-04-08 06:27:29,303 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-08 06:27:29,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 207 transitions. [2022-04-08 06:27:31,585 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-08 06:27:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 207 transitions. [2022-04-08 06:27:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-08 06:27:31,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:27:31,586 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-08 06:27:31,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-08 06:27:31,786 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-08 06:27:31,787 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:27:31,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:27:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash 114996177, now seen corresponding path program 7 times [2022-04-08 06:27:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:27:31,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [789239336] [2022-04-08 06:27:39,294 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:27:39,294 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:27:39,294 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:27:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash 114996177, now seen corresponding path program 8 times [2022-04-08 06:27:39,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:27:39,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618701145] [2022-04-08 06:27:39,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:27:39,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:27:39,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:27:39,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [395626103] [2022-04-08 06:27:39,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:27:39,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:27:39,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:27:39,330 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-08 06:27:39,331 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-08 06:27:39,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:27:39,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:27:39,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:27:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:27:39,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:27:39,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {21725#true} call ULTIMATE.init(); {21725#true} is VALID [2022-04-08 06:27:39,711 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-08 06:27:39,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {21733#(<= ~counter~0 0)} assume true; {21733#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:39,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21733#(<= ~counter~0 0)} {21725#true} #96#return; {21733#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:39,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {21733#(<= ~counter~0 0)} call #t~ret8 := main(); {21733#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:39,712 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-08 06:27:39,713 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-08 06:27:39,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {21733#(<= ~counter~0 0)} ~cond := #in~cond; {21733#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:39,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {21733#(<= ~counter~0 0)} assume !(0 == ~cond); {21733#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:39,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {21733#(<= ~counter~0 0)} assume true; {21733#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:39,714 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21733#(<= ~counter~0 0)} {21733#(<= ~counter~0 0)} #80#return; {21733#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:39,714 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-08 06:27:39,715 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-08 06:27:39,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {21767#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {21767#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:39,715 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-08 06:27:39,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {21767#(<= ~counter~0 1)} ~cond := #in~cond; {21767#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:39,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {21767#(<= ~counter~0 1)} assume !(0 == ~cond); {21767#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:39,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {21767#(<= ~counter~0 1)} assume true; {21767#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:39,716 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21767#(<= ~counter~0 1)} {21767#(<= ~counter~0 1)} #82#return; {21767#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:39,717 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-08 06:27:39,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {21767#(<= ~counter~0 1)} ~cond := #in~cond; {21767#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:39,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {21767#(<= ~counter~0 1)} assume !(0 == ~cond); {21767#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:39,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {21767#(<= ~counter~0 1)} assume true; {21767#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:39,718 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21767#(<= ~counter~0 1)} {21767#(<= ~counter~0 1)} #84#return; {21767#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:39,719 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-08 06:27:39,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {21767#(<= ~counter~0 1)} ~cond := #in~cond; {21767#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:39,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {21767#(<= ~counter~0 1)} assume !(0 == ~cond); {21767#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:39,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {21767#(<= ~counter~0 1)} assume true; {21767#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:39,720 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {21767#(<= ~counter~0 1)} {21767#(<= ~counter~0 1)} #86#return; {21767#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:39,720 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-08 06:27:39,721 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-08 06:27:39,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {21822#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {21822#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:39,722 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-08 06:27:39,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {21822#(<= ~counter~0 2)} ~cond := #in~cond; {21822#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:39,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {21822#(<= ~counter~0 2)} assume !(0 == ~cond); {21822#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:39,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {21822#(<= ~counter~0 2)} assume true; {21822#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:39,723 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21822#(<= ~counter~0 2)} {21822#(<= ~counter~0 2)} #82#return; {21822#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:39,724 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-08 06:27:39,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {21822#(<= ~counter~0 2)} ~cond := #in~cond; {21822#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:39,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {21822#(<= ~counter~0 2)} assume !(0 == ~cond); {21822#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:39,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {21822#(<= ~counter~0 2)} assume true; {21822#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:39,726 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21822#(<= ~counter~0 2)} {21822#(<= ~counter~0 2)} #84#return; {21822#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:39,727 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-08 06:27:39,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {21822#(<= ~counter~0 2)} ~cond := #in~cond; {21822#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:39,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {21822#(<= ~counter~0 2)} assume !(0 == ~cond); {21822#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:39,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {21822#(<= ~counter~0 2)} assume true; {21822#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:39,728 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21822#(<= ~counter~0 2)} {21822#(<= ~counter~0 2)} #86#return; {21822#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:39,728 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-08 06:27:39,729 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-08 06:27:39,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {21877#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {21877#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:39,729 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-08 06:27:39,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {21877#(<= ~counter~0 3)} ~cond := #in~cond; {21877#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:39,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {21877#(<= ~counter~0 3)} assume !(0 == ~cond); {21877#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:39,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {21877#(<= ~counter~0 3)} assume true; {21877#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:39,730 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21877#(<= ~counter~0 3)} {21877#(<= ~counter~0 3)} #82#return; {21877#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:39,731 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-08 06:27:39,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {21877#(<= ~counter~0 3)} ~cond := #in~cond; {21877#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:39,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {21877#(<= ~counter~0 3)} assume !(0 == ~cond); {21877#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:39,732 INFO L290 TraceCheckUtils]: 58: Hoare triple {21877#(<= ~counter~0 3)} assume true; {21877#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:39,732 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21877#(<= ~counter~0 3)} {21877#(<= ~counter~0 3)} #84#return; {21877#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:39,732 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-08 06:27:39,733 INFO L290 TraceCheckUtils]: 61: Hoare triple {21877#(<= ~counter~0 3)} ~cond := #in~cond; {21877#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:39,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {21877#(<= ~counter~0 3)} assume !(0 == ~cond); {21877#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:39,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {21877#(<= ~counter~0 3)} assume true; {21877#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:39,734 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21877#(<= ~counter~0 3)} {21877#(<= ~counter~0 3)} #86#return; {21877#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:39,734 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-08 06:27:39,734 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-08 06:27:39,735 INFO L290 TraceCheckUtils]: 67: Hoare triple {21932#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {21932#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:39,735 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-08 06:27:39,735 INFO L290 TraceCheckUtils]: 69: Hoare triple {21932#(<= ~counter~0 4)} ~cond := #in~cond; {21932#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:39,736 INFO L290 TraceCheckUtils]: 70: Hoare triple {21932#(<= ~counter~0 4)} assume !(0 == ~cond); {21932#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:39,736 INFO L290 TraceCheckUtils]: 71: Hoare triple {21932#(<= ~counter~0 4)} assume true; {21932#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:39,736 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21932#(<= ~counter~0 4)} {21932#(<= ~counter~0 4)} #82#return; {21932#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:39,737 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-08 06:27:39,737 INFO L290 TraceCheckUtils]: 74: Hoare triple {21932#(<= ~counter~0 4)} ~cond := #in~cond; {21932#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:39,737 INFO L290 TraceCheckUtils]: 75: Hoare triple {21932#(<= ~counter~0 4)} assume !(0 == ~cond); {21932#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:39,737 INFO L290 TraceCheckUtils]: 76: Hoare triple {21932#(<= ~counter~0 4)} assume true; {21932#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:39,738 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21932#(<= ~counter~0 4)} {21932#(<= ~counter~0 4)} #84#return; {21932#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:39,738 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-08 06:27:39,739 INFO L290 TraceCheckUtils]: 79: Hoare triple {21932#(<= ~counter~0 4)} ~cond := #in~cond; {21932#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:39,739 INFO L290 TraceCheckUtils]: 80: Hoare triple {21932#(<= ~counter~0 4)} assume !(0 == ~cond); {21932#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:39,739 INFO L290 TraceCheckUtils]: 81: Hoare triple {21932#(<= ~counter~0 4)} assume true; {21932#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:39,740 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {21932#(<= ~counter~0 4)} {21932#(<= ~counter~0 4)} #86#return; {21932#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:39,740 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-08 06:27:39,740 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-08 06:27:39,741 INFO L290 TraceCheckUtils]: 85: Hoare triple {21987#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {21726#false} is VALID [2022-04-08 06:27:39,741 INFO L290 TraceCheckUtils]: 86: Hoare triple {21726#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21726#false} is VALID [2022-04-08 06:27:39,741 INFO L290 TraceCheckUtils]: 87: Hoare triple {21726#false} assume !(#t~post7 < 50);havoc #t~post7; {21726#false} is VALID [2022-04-08 06:27:39,741 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-08 06:27:39,741 INFO L290 TraceCheckUtils]: 89: Hoare triple {21726#false} ~cond := #in~cond; {21726#false} is VALID [2022-04-08 06:27:39,741 INFO L290 TraceCheckUtils]: 90: Hoare triple {21726#false} assume !(0 == ~cond); {21726#false} is VALID [2022-04-08 06:27:39,741 INFO L290 TraceCheckUtils]: 91: Hoare triple {21726#false} assume true; {21726#false} is VALID [2022-04-08 06:27:39,741 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {21726#false} {21726#false} #92#return; {21726#false} is VALID [2022-04-08 06:27:39,741 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-08 06:27:39,741 INFO L290 TraceCheckUtils]: 94: Hoare triple {21726#false} ~cond := #in~cond; {21726#false} is VALID [2022-04-08 06:27:39,741 INFO L290 TraceCheckUtils]: 95: Hoare triple {21726#false} assume 0 == ~cond; {21726#false} is VALID [2022-04-08 06:27:39,741 INFO L290 TraceCheckUtils]: 96: Hoare triple {21726#false} assume !false; {21726#false} is VALID [2022-04-08 06:27:39,742 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-08 06:27:39,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:27:40,112 INFO L290 TraceCheckUtils]: 96: Hoare triple {21726#false} assume !false; {21726#false} is VALID [2022-04-08 06:27:40,112 INFO L290 TraceCheckUtils]: 95: Hoare triple {21726#false} assume 0 == ~cond; {21726#false} is VALID [2022-04-08 06:27:40,112 INFO L290 TraceCheckUtils]: 94: Hoare triple {21726#false} ~cond := #in~cond; {21726#false} is VALID [2022-04-08 06:27:40,112 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-08 06:27:40,112 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {21725#true} {21726#false} #92#return; {21726#false} is VALID [2022-04-08 06:27:40,112 INFO L290 TraceCheckUtils]: 91: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,112 INFO L290 TraceCheckUtils]: 90: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,112 INFO L290 TraceCheckUtils]: 89: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,112 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-08 06:27:40,112 INFO L290 TraceCheckUtils]: 87: Hoare triple {21726#false} assume !(#t~post7 < 50);havoc #t~post7; {21726#false} is VALID [2022-04-08 06:27:40,113 INFO L290 TraceCheckUtils]: 86: Hoare triple {21726#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21726#false} is VALID [2022-04-08 06:27:40,113 INFO L290 TraceCheckUtils]: 85: Hoare triple {22057#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {21726#false} is VALID [2022-04-08 06:27:40,113 INFO L290 TraceCheckUtils]: 84: Hoare triple {22061#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22057#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:27:40,113 INFO L290 TraceCheckUtils]: 83: Hoare triple {22061#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22061#(< ~counter~0 50)} is VALID [2022-04-08 06:27:40,114 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {21725#true} {22061#(< ~counter~0 50)} #86#return; {22061#(< ~counter~0 50)} is VALID [2022-04-08 06:27:40,114 INFO L290 TraceCheckUtils]: 81: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,114 INFO L290 TraceCheckUtils]: 80: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,114 INFO L290 TraceCheckUtils]: 79: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,114 INFO L272 TraceCheckUtils]: 78: Hoare triple {22061#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21725#true} is VALID [2022-04-08 06:27:40,114 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21725#true} {22061#(< ~counter~0 50)} #84#return; {22061#(< ~counter~0 50)} is VALID [2022-04-08 06:27:40,115 INFO L290 TraceCheckUtils]: 76: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,115 INFO L290 TraceCheckUtils]: 75: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,115 INFO L290 TraceCheckUtils]: 74: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,115 INFO L272 TraceCheckUtils]: 73: Hoare triple {22061#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21725#true} is VALID [2022-04-08 06:27:40,115 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21725#true} {22061#(< ~counter~0 50)} #82#return; {22061#(< ~counter~0 50)} is VALID [2022-04-08 06:27:40,115 INFO L290 TraceCheckUtils]: 71: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,115 INFO L290 TraceCheckUtils]: 70: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,115 INFO L290 TraceCheckUtils]: 69: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,115 INFO L272 TraceCheckUtils]: 68: Hoare triple {22061#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21725#true} is VALID [2022-04-08 06:27:40,116 INFO L290 TraceCheckUtils]: 67: Hoare triple {22061#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {22061#(< ~counter~0 50)} is VALID [2022-04-08 06:27:40,116 INFO L290 TraceCheckUtils]: 66: Hoare triple {22116#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22061#(< ~counter~0 50)} is VALID [2022-04-08 06:27:40,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {22116#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22116#(< ~counter~0 49)} is VALID [2022-04-08 06:27:40,117 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21725#true} {22116#(< ~counter~0 49)} #86#return; {22116#(< ~counter~0 49)} is VALID [2022-04-08 06:27:40,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,117 INFO L290 TraceCheckUtils]: 62: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,117 INFO L272 TraceCheckUtils]: 60: Hoare triple {22116#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21725#true} is VALID [2022-04-08 06:27:40,118 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21725#true} {22116#(< ~counter~0 49)} #84#return; {22116#(< ~counter~0 49)} is VALID [2022-04-08 06:27:40,118 INFO L290 TraceCheckUtils]: 58: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,118 INFO L290 TraceCheckUtils]: 57: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,118 INFO L272 TraceCheckUtils]: 55: Hoare triple {22116#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21725#true} is VALID [2022-04-08 06:27:40,118 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21725#true} {22116#(< ~counter~0 49)} #82#return; {22116#(< ~counter~0 49)} is VALID [2022-04-08 06:27:40,118 INFO L290 TraceCheckUtils]: 53: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,119 INFO L290 TraceCheckUtils]: 52: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,119 INFO L290 TraceCheckUtils]: 51: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,119 INFO L272 TraceCheckUtils]: 50: Hoare triple {22116#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21725#true} is VALID [2022-04-08 06:27:40,119 INFO L290 TraceCheckUtils]: 49: Hoare triple {22116#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {22116#(< ~counter~0 49)} is VALID [2022-04-08 06:27:40,119 INFO L290 TraceCheckUtils]: 48: Hoare triple {22171#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22116#(< ~counter~0 49)} is VALID [2022-04-08 06:27:40,120 INFO L290 TraceCheckUtils]: 47: Hoare triple {22171#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22171#(< ~counter~0 48)} is VALID [2022-04-08 06:27:40,120 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21725#true} {22171#(< ~counter~0 48)} #86#return; {22171#(< ~counter~0 48)} is VALID [2022-04-08 06:27:40,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,121 INFO L272 TraceCheckUtils]: 42: Hoare triple {22171#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21725#true} is VALID [2022-04-08 06:27:40,121 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21725#true} {22171#(< ~counter~0 48)} #84#return; {22171#(< ~counter~0 48)} is VALID [2022-04-08 06:27:40,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,121 INFO L272 TraceCheckUtils]: 37: Hoare triple {22171#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21725#true} is VALID [2022-04-08 06:27:40,122 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21725#true} {22171#(< ~counter~0 48)} #82#return; {22171#(< ~counter~0 48)} is VALID [2022-04-08 06:27:40,122 INFO L290 TraceCheckUtils]: 35: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,122 INFO L272 TraceCheckUtils]: 32: Hoare triple {22171#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21725#true} is VALID [2022-04-08 06:27:40,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {22171#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {22171#(< ~counter~0 48)} is VALID [2022-04-08 06:27:40,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {22226#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22171#(< ~counter~0 48)} is VALID [2022-04-08 06:27:40,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {22226#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22226#(< ~counter~0 47)} is VALID [2022-04-08 06:27:40,123 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {21725#true} {22226#(< ~counter~0 47)} #86#return; {22226#(< ~counter~0 47)} is VALID [2022-04-08 06:27:40,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,124 INFO L272 TraceCheckUtils]: 24: Hoare triple {22226#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21725#true} is VALID [2022-04-08 06:27:40,124 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21725#true} {22226#(< ~counter~0 47)} #84#return; {22226#(< ~counter~0 47)} is VALID [2022-04-08 06:27:40,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,124 INFO L272 TraceCheckUtils]: 19: Hoare triple {22226#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21725#true} is VALID [2022-04-08 06:27:40,125 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21725#true} {22226#(< ~counter~0 47)} #82#return; {22226#(< ~counter~0 47)} is VALID [2022-04-08 06:27:40,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,125 INFO L272 TraceCheckUtils]: 14: Hoare triple {22226#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21725#true} is VALID [2022-04-08 06:27:40,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {22226#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {22226#(< ~counter~0 47)} is VALID [2022-04-08 06:27:40,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {22281#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22226#(< ~counter~0 47)} is VALID [2022-04-08 06:27:40,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {22281#(< ~counter~0 46)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {22281#(< ~counter~0 46)} is VALID [2022-04-08 06:27:40,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21725#true} {22281#(< ~counter~0 46)} #80#return; {22281#(< ~counter~0 46)} is VALID [2022-04-08 06:27:40,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-08 06:27:40,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-08 06:27:40,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-08 06:27:40,127 INFO L272 TraceCheckUtils]: 6: Hoare triple {22281#(< ~counter~0 46)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {21725#true} is VALID [2022-04-08 06:27:40,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {22281#(< ~counter~0 46)} 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 46)} is VALID [2022-04-08 06:27:40,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {22281#(< ~counter~0 46)} call #t~ret8 := main(); {22281#(< ~counter~0 46)} is VALID [2022-04-08 06:27:40,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22281#(< ~counter~0 46)} {21725#true} #96#return; {22281#(< ~counter~0 46)} is VALID [2022-04-08 06:27:40,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {22281#(< ~counter~0 46)} assume true; {22281#(< ~counter~0 46)} is VALID [2022-04-08 06:27:40,128 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 46)} is VALID [2022-04-08 06:27:40,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {21725#true} call ULTIMATE.init(); {21725#true} is VALID [2022-04-08 06:27:40,129 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-08 06:27:40,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:27:40,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618701145] [2022-04-08 06:27:40,129 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:27:40,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395626103] [2022-04-08 06:27:40,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395626103] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:27:40,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:27:40,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 06:27:40,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:27:40,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [789239336] [2022-04-08 06:27:40,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [789239336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:27:40,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:27:40,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:27:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117285966] [2022-04-08 06:27:40,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:27:40,130 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-08 06:27:40,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:27:40,130 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-08 06:27:40,185 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-08 06:27:40,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:27:40,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:27:40,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:27:40,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:27:40,185 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-08 06:27:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:27:40,686 INFO L93 Difference]: Finished difference Result 225 states and 269 transitions. [2022-04-08 06:27:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 06:27:40,687 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-08 06:27:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:27:40,687 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-08 06:27:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2022-04-08 06:27:40,688 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-08 06:27:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2022-04-08 06:27:40,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 123 transitions. [2022-04-08 06:27:40,834 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-08 06:27:40,836 INFO L225 Difference]: With dead ends: 225 [2022-04-08 06:27:40,836 INFO L226 Difference]: Without dead ends: 182 [2022-04-08 06:27:40,837 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-08 06:27:40,837 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-08 06:27:40,837 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-08 06:27:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-08 06:27:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-04-08 06:27:41,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:27:41,025 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-08 06:27:41,025 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-08 06:27:41,025 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-08 06:27:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:27:41,028 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2022-04-08 06:27:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2022-04-08 06:27:41,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:27:41,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:27:41,029 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-08 06:27:41,029 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-08 06:27:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:27:41,031 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2022-04-08 06:27:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2022-04-08 06:27:41,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:27:41,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:27:41,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:27:41,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:27:41,032 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-08 06:27:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 209 transitions. [2022-04-08 06:27:41,043 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 209 transitions. Word has length 97 [2022-04-08 06:27:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:27:41,044 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 209 transitions. [2022-04-08 06:27:41,044 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-08 06:27:41,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 209 transitions. [2022-04-08 06:27:43,365 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-08 06:27:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2022-04-08 06:27:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-08 06:27:43,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:27:43,366 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-08 06:27:43,383 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-08 06:27:43,566 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-08 06:27:43,566 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:27:43,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:27:43,567 INFO L85 PathProgramCache]: Analyzing trace with hash -545719131, now seen corresponding path program 5 times [2022-04-08 06:27:43,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:27:43,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1922892654] [2022-04-08 06:27:50,559 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:27:50,560 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:27:50,560 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:27:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash -545719131, now seen corresponding path program 6 times [2022-04-08 06:27:50,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:27:50,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281654572] [2022-04-08 06:27:50,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:27:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:27:50,576 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:27:50,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562501930] [2022-04-08 06:27:50,577 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:27:50,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:27:50,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:27:50,592 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-08 06:27:50,592 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-08 06:27:50,726 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 06:27:50,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:27:50,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 06:27:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:27:50,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:27:51,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {23506#true} call ULTIMATE.init(); {23506#true} is VALID [2022-04-08 06:27:51,090 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-08 06:27:51,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {23514#(<= ~counter~0 0)} assume true; {23514#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:51,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23514#(<= ~counter~0 0)} {23506#true} #96#return; {23514#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:51,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {23514#(<= ~counter~0 0)} call #t~ret8 := main(); {23514#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:51,091 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-08 06:27:51,091 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-08 06:27:51,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {23514#(<= ~counter~0 0)} ~cond := #in~cond; {23514#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:51,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {23514#(<= ~counter~0 0)} assume !(0 == ~cond); {23514#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:51,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {23514#(<= ~counter~0 0)} assume true; {23514#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:51,092 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23514#(<= ~counter~0 0)} {23514#(<= ~counter~0 0)} #80#return; {23514#(<= ~counter~0 0)} is VALID [2022-04-08 06:27:51,093 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-08 06:27:51,093 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-08 06:27:51,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {23548#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {23548#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:51,094 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-08 06:27:51,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {23548#(<= ~counter~0 1)} ~cond := #in~cond; {23548#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:51,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {23548#(<= ~counter~0 1)} assume !(0 == ~cond); {23548#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:51,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {23548#(<= ~counter~0 1)} assume true; {23548#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:51,095 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23548#(<= ~counter~0 1)} {23548#(<= ~counter~0 1)} #82#return; {23548#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:51,095 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-08 06:27:51,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {23548#(<= ~counter~0 1)} ~cond := #in~cond; {23548#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:51,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {23548#(<= ~counter~0 1)} assume !(0 == ~cond); {23548#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:51,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {23548#(<= ~counter~0 1)} assume true; {23548#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:51,097 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23548#(<= ~counter~0 1)} {23548#(<= ~counter~0 1)} #84#return; {23548#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:51,097 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-08 06:27:51,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {23548#(<= ~counter~0 1)} ~cond := #in~cond; {23548#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:51,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {23548#(<= ~counter~0 1)} assume !(0 == ~cond); {23548#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:51,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {23548#(<= ~counter~0 1)} assume true; {23548#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:51,098 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {23548#(<= ~counter~0 1)} {23548#(<= ~counter~0 1)} #86#return; {23548#(<= ~counter~0 1)} is VALID [2022-04-08 06:27:51,098 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-08 06:27:51,099 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-08 06:27:51,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {23603#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {23603#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:51,099 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-08 06:27:51,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {23603#(<= ~counter~0 2)} ~cond := #in~cond; {23603#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:51,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {23603#(<= ~counter~0 2)} assume !(0 == ~cond); {23603#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:51,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {23603#(<= ~counter~0 2)} assume true; {23603#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:51,101 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {23603#(<= ~counter~0 2)} {23603#(<= ~counter~0 2)} #82#return; {23603#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:51,101 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-08 06:27:51,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {23603#(<= ~counter~0 2)} ~cond := #in~cond; {23603#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:51,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {23603#(<= ~counter~0 2)} assume !(0 == ~cond); {23603#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:51,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {23603#(<= ~counter~0 2)} assume true; {23603#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:51,102 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {23603#(<= ~counter~0 2)} {23603#(<= ~counter~0 2)} #84#return; {23603#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:51,103 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-08 06:27:51,103 INFO L290 TraceCheckUtils]: 43: Hoare triple {23603#(<= ~counter~0 2)} ~cond := #in~cond; {23603#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:51,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {23603#(<= ~counter~0 2)} assume !(0 == ~cond); {23603#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:51,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {23603#(<= ~counter~0 2)} assume true; {23603#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:51,104 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {23603#(<= ~counter~0 2)} {23603#(<= ~counter~0 2)} #86#return; {23603#(<= ~counter~0 2)} is VALID [2022-04-08 06:27:51,104 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-08 06:27:51,104 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-08 06:27:51,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {23658#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,105 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-08 06:27:51,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {23658#(<= ~counter~0 3)} ~cond := #in~cond; {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {23658#(<= ~counter~0 3)} assume !(0 == ~cond); {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {23658#(<= ~counter~0 3)} assume true; {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,106 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {23658#(<= ~counter~0 3)} {23658#(<= ~counter~0 3)} #82#return; {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,106 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-08 06:27:51,107 INFO L290 TraceCheckUtils]: 56: Hoare triple {23658#(<= ~counter~0 3)} ~cond := #in~cond; {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {23658#(<= ~counter~0 3)} assume !(0 == ~cond); {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,107 INFO L290 TraceCheckUtils]: 58: Hoare triple {23658#(<= ~counter~0 3)} assume true; {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,108 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23658#(<= ~counter~0 3)} {23658#(<= ~counter~0 3)} #84#return; {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,108 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-08 06:27:51,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {23658#(<= ~counter~0 3)} ~cond := #in~cond; {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,109 INFO L290 TraceCheckUtils]: 62: Hoare triple {23658#(<= ~counter~0 3)} assume !(0 == ~cond); {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,109 INFO L290 TraceCheckUtils]: 63: Hoare triple {23658#(<= ~counter~0 3)} assume true; {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,109 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23658#(<= ~counter~0 3)} {23658#(<= ~counter~0 3)} #86#return; {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,109 INFO L290 TraceCheckUtils]: 65: Hoare triple {23658#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {23658#(<= ~counter~0 3)} is VALID [2022-04-08 06:27:51,110 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-08 06:27:51,110 INFO L290 TraceCheckUtils]: 67: Hoare triple {23713#(<= ~counter~0 4)} assume !!(#t~post7 < 50);havoc #t~post7; {23713#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:51,111 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-08 06:27:51,111 INFO L290 TraceCheckUtils]: 69: Hoare triple {23713#(<= ~counter~0 4)} ~cond := #in~cond; {23713#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:51,111 INFO L290 TraceCheckUtils]: 70: Hoare triple {23713#(<= ~counter~0 4)} assume !(0 == ~cond); {23713#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:51,111 INFO L290 TraceCheckUtils]: 71: Hoare triple {23713#(<= ~counter~0 4)} assume true; {23713#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:51,112 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {23713#(<= ~counter~0 4)} {23713#(<= ~counter~0 4)} #88#return; {23713#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:51,112 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-08 06:27:51,112 INFO L290 TraceCheckUtils]: 74: Hoare triple {23713#(<= ~counter~0 4)} ~cond := #in~cond; {23713#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:51,113 INFO L290 TraceCheckUtils]: 75: Hoare triple {23713#(<= ~counter~0 4)} assume !(0 == ~cond); {23713#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:51,113 INFO L290 TraceCheckUtils]: 76: Hoare triple {23713#(<= ~counter~0 4)} assume true; {23713#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:51,113 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {23713#(<= ~counter~0 4)} {23713#(<= ~counter~0 4)} #90#return; {23713#(<= ~counter~0 4)} is VALID [2022-04-08 06:27:51,114 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-08 06:27:51,114 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-08 06:27:51,114 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-08 06:27:51,115 INFO L290 TraceCheckUtils]: 81: Hoare triple {23756#(<= ~counter~0 5)} assume !!(#t~post7 < 50);havoc #t~post7; {23756#(<= ~counter~0 5)} is VALID [2022-04-08 06:27:51,115 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-08 06:27:51,115 INFO L290 TraceCheckUtils]: 83: Hoare triple {23756#(<= ~counter~0 5)} ~cond := #in~cond; {23756#(<= ~counter~0 5)} is VALID [2022-04-08 06:27:51,116 INFO L290 TraceCheckUtils]: 84: Hoare triple {23756#(<= ~counter~0 5)} assume !(0 == ~cond); {23756#(<= ~counter~0 5)} is VALID [2022-04-08 06:27:51,116 INFO L290 TraceCheckUtils]: 85: Hoare triple {23756#(<= ~counter~0 5)} assume true; {23756#(<= ~counter~0 5)} is VALID [2022-04-08 06:27:51,116 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {23756#(<= ~counter~0 5)} {23756#(<= ~counter~0 5)} #88#return; {23756#(<= ~counter~0 5)} is VALID [2022-04-08 06:27:51,117 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-08 06:27:51,117 INFO L290 TraceCheckUtils]: 88: Hoare triple {23756#(<= ~counter~0 5)} ~cond := #in~cond; {23756#(<= ~counter~0 5)} is VALID [2022-04-08 06:27:51,117 INFO L290 TraceCheckUtils]: 89: Hoare triple {23756#(<= ~counter~0 5)} assume !(0 == ~cond); {23756#(<= ~counter~0 5)} is VALID [2022-04-08 06:27:51,117 INFO L290 TraceCheckUtils]: 90: Hoare triple {23756#(<= ~counter~0 5)} assume true; {23756#(<= ~counter~0 5)} is VALID [2022-04-08 06:27:51,118 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {23756#(<= ~counter~0 5)} {23756#(<= ~counter~0 5)} #90#return; {23756#(<= ~counter~0 5)} is VALID [2022-04-08 06:27:51,118 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-08 06:27:51,118 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-08 06:27:51,119 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-08 06:27:51,119 INFO L290 TraceCheckUtils]: 95: Hoare triple {23799#(<= |main_#t~post7| 5)} assume !(#t~post7 < 50);havoc #t~post7; {23507#false} is VALID [2022-04-08 06:27:51,119 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-08 06:27:51,119 INFO L290 TraceCheckUtils]: 97: Hoare triple {23507#false} ~cond := #in~cond; {23507#false} is VALID [2022-04-08 06:27:51,119 INFO L290 TraceCheckUtils]: 98: Hoare triple {23507#false} assume 0 == ~cond; {23507#false} is VALID [2022-04-08 06:27:51,119 INFO L290 TraceCheckUtils]: 99: Hoare triple {23507#false} assume !false; {23507#false} is VALID [2022-04-08 06:27:51,120 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-08 06:27:51,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:27:51,476 INFO L290 TraceCheckUtils]: 99: Hoare triple {23507#false} assume !false; {23507#false} is VALID [2022-04-08 06:27:51,476 INFO L290 TraceCheckUtils]: 98: Hoare triple {23507#false} assume 0 == ~cond; {23507#false} is VALID [2022-04-08 06:27:51,476 INFO L290 TraceCheckUtils]: 97: Hoare triple {23507#false} ~cond := #in~cond; {23507#false} is VALID [2022-04-08 06:27:51,476 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-08 06:27:51,476 INFO L290 TraceCheckUtils]: 95: Hoare triple {23827#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {23507#false} is VALID [2022-04-08 06:27:51,477 INFO L290 TraceCheckUtils]: 94: Hoare triple {23831#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23827#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:27:51,477 INFO L290 TraceCheckUtils]: 93: Hoare triple {23831#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {23831#(< ~counter~0 50)} is VALID [2022-04-08 06:27:51,477 INFO L290 TraceCheckUtils]: 92: Hoare triple {23831#(< ~counter~0 50)} 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 50)} is VALID [2022-04-08 06:27:51,478 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {23506#true} {23831#(< ~counter~0 50)} #90#return; {23831#(< ~counter~0 50)} is VALID [2022-04-08 06:27:51,478 INFO L290 TraceCheckUtils]: 90: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,478 INFO L290 TraceCheckUtils]: 89: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,478 INFO L290 TraceCheckUtils]: 88: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,478 INFO L272 TraceCheckUtils]: 87: Hoare triple {23831#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,479 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {23506#true} {23831#(< ~counter~0 50)} #88#return; {23831#(< ~counter~0 50)} is VALID [2022-04-08 06:27:51,479 INFO L290 TraceCheckUtils]: 85: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,479 INFO L290 TraceCheckUtils]: 84: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,479 INFO L290 TraceCheckUtils]: 83: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,479 INFO L272 TraceCheckUtils]: 82: Hoare triple {23831#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,500 INFO L290 TraceCheckUtils]: 81: Hoare triple {23831#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {23831#(< ~counter~0 50)} is VALID [2022-04-08 06:27:51,501 INFO L290 TraceCheckUtils]: 80: Hoare triple {23874#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23831#(< ~counter~0 50)} is VALID [2022-04-08 06:27:51,501 INFO L290 TraceCheckUtils]: 79: Hoare triple {23874#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {23874#(< ~counter~0 49)} is VALID [2022-04-08 06:27:51,502 INFO L290 TraceCheckUtils]: 78: Hoare triple {23874#(< ~counter~0 49)} 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 49)} is VALID [2022-04-08 06:27:51,502 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {23506#true} {23874#(< ~counter~0 49)} #90#return; {23874#(< ~counter~0 49)} is VALID [2022-04-08 06:27:51,502 INFO L290 TraceCheckUtils]: 76: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,502 INFO L290 TraceCheckUtils]: 75: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,502 INFO L290 TraceCheckUtils]: 74: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,502 INFO L272 TraceCheckUtils]: 73: Hoare triple {23874#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,503 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {23506#true} {23874#(< ~counter~0 49)} #88#return; {23874#(< ~counter~0 49)} is VALID [2022-04-08 06:27:51,503 INFO L290 TraceCheckUtils]: 71: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,503 INFO L290 TraceCheckUtils]: 70: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,503 INFO L290 TraceCheckUtils]: 69: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,503 INFO L272 TraceCheckUtils]: 68: Hoare triple {23874#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,503 INFO L290 TraceCheckUtils]: 67: Hoare triple {23874#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {23874#(< ~counter~0 49)} is VALID [2022-04-08 06:27:51,504 INFO L290 TraceCheckUtils]: 66: Hoare triple {23917#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23874#(< ~counter~0 49)} is VALID [2022-04-08 06:27:51,504 INFO L290 TraceCheckUtils]: 65: Hoare triple {23917#(< ~counter~0 48)} assume !(~r~0 >= ~d~0); {23917#(< ~counter~0 48)} is VALID [2022-04-08 06:27:51,505 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23506#true} {23917#(< ~counter~0 48)} #86#return; {23917#(< ~counter~0 48)} is VALID [2022-04-08 06:27:51,505 INFO L290 TraceCheckUtils]: 63: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,505 INFO L290 TraceCheckUtils]: 62: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,505 INFO L272 TraceCheckUtils]: 60: Hoare triple {23917#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,505 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23506#true} {23917#(< ~counter~0 48)} #84#return; {23917#(< ~counter~0 48)} is VALID [2022-04-08 06:27:51,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,506 INFO L272 TraceCheckUtils]: 55: Hoare triple {23917#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,506 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {23506#true} {23917#(< ~counter~0 48)} #82#return; {23917#(< ~counter~0 48)} is VALID [2022-04-08 06:27:51,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,506 INFO L290 TraceCheckUtils]: 52: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,506 INFO L272 TraceCheckUtils]: 50: Hoare triple {23917#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {23917#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {23917#(< ~counter~0 48)} is VALID [2022-04-08 06:27:51,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {23972#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23917#(< ~counter~0 48)} is VALID [2022-04-08 06:27:51,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {23972#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23972#(< ~counter~0 47)} is VALID [2022-04-08 06:27:51,508 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {23506#true} {23972#(< ~counter~0 47)} #86#return; {23972#(< ~counter~0 47)} is VALID [2022-04-08 06:27:51,508 INFO L290 TraceCheckUtils]: 45: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,508 INFO L290 TraceCheckUtils]: 44: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,508 INFO L290 TraceCheckUtils]: 43: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,508 INFO L272 TraceCheckUtils]: 42: Hoare triple {23972#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,508 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {23506#true} {23972#(< ~counter~0 47)} #84#return; {23972#(< ~counter~0 47)} is VALID [2022-04-08 06:27:51,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,509 INFO L272 TraceCheckUtils]: 37: Hoare triple {23972#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,509 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {23506#true} {23972#(< ~counter~0 47)} #82#return; {23972#(< ~counter~0 47)} is VALID [2022-04-08 06:27:51,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,509 INFO L272 TraceCheckUtils]: 32: Hoare triple {23972#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {23972#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {23972#(< ~counter~0 47)} is VALID [2022-04-08 06:27:51,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {24027#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23972#(< ~counter~0 47)} is VALID [2022-04-08 06:27:51,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {24027#(< ~counter~0 46)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24027#(< ~counter~0 46)} is VALID [2022-04-08 06:27:51,511 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {23506#true} {24027#(< ~counter~0 46)} #86#return; {24027#(< ~counter~0 46)} is VALID [2022-04-08 06:27:51,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,511 INFO L272 TraceCheckUtils]: 24: Hoare triple {24027#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,511 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23506#true} {24027#(< ~counter~0 46)} #84#return; {24027#(< ~counter~0 46)} is VALID [2022-04-08 06:27:51,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,512 INFO L272 TraceCheckUtils]: 19: Hoare triple {24027#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,512 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23506#true} {24027#(< ~counter~0 46)} #82#return; {24027#(< ~counter~0 46)} is VALID [2022-04-08 06:27:51,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,512 INFO L272 TraceCheckUtils]: 14: Hoare triple {24027#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {24027#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {24027#(< ~counter~0 46)} is VALID [2022-04-08 06:27:51,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {24082#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24027#(< ~counter~0 46)} is VALID [2022-04-08 06:27:51,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {24082#(< ~counter~0 45)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {24082#(< ~counter~0 45)} is VALID [2022-04-08 06:27:51,513 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23506#true} {24082#(< ~counter~0 45)} #80#return; {24082#(< ~counter~0 45)} is VALID [2022-04-08 06:27:51,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-08 06:27:51,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-08 06:27:51,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-08 06:27:51,514 INFO L272 TraceCheckUtils]: 6: Hoare triple {24082#(< ~counter~0 45)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {23506#true} is VALID [2022-04-08 06:27:51,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {24082#(< ~counter~0 45)} 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 45)} is VALID [2022-04-08 06:27:51,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {24082#(< ~counter~0 45)} call #t~ret8 := main(); {24082#(< ~counter~0 45)} is VALID [2022-04-08 06:27:51,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24082#(< ~counter~0 45)} {23506#true} #96#return; {24082#(< ~counter~0 45)} is VALID [2022-04-08 06:27:51,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {24082#(< ~counter~0 45)} assume true; {24082#(< ~counter~0 45)} is VALID [2022-04-08 06:27:51,515 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 45)} is VALID [2022-04-08 06:27:51,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {23506#true} call ULTIMATE.init(); {23506#true} is VALID [2022-04-08 06:27:51,516 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-08 06:27:51,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:27:51,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281654572] [2022-04-08 06:27:51,516 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:27:51,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562501930] [2022-04-08 06:27:51,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562501930] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:27:51,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:27:51,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 06:27:51,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:27:51,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1922892654] [2022-04-08 06:27:51,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1922892654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:27:51,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:27:51,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:27:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245177087] [2022-04-08 06:27:51,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:27:51,517 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-08 06:27:51,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:27:51,517 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-08 06:27:51,574 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-08 06:27:51,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:27:51,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:27:51,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:27:51,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 06:27:51,574 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-08 06:27:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:27:52,224 INFO L93 Difference]: Finished difference Result 243 states and 275 transitions. [2022-04-08 06:27:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 06:27:52,225 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-08 06:27:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:27:52,225 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-08 06:27:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2022-04-08 06:27:52,226 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-08 06:27:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2022-04-08 06:27:52,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 140 transitions. [2022-04-08 06:27:52,343 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-08 06:27:52,348 INFO L225 Difference]: With dead ends: 243 [2022-04-08 06:27:52,348 INFO L226 Difference]: Without dead ends: 227 [2022-04-08 06:27:52,348 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-08 06:27:52,349 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-08 06:27:52,350 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-08 06:27:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-08 06:27:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2022-04-08 06:27:52,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:27:52,584 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-08 06:27:52,584 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-08 06:27:52,584 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-08 06:27:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:27:52,589 INFO L93 Difference]: Finished difference Result 227 states and 254 transitions. [2022-04-08 06:27:52,589 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 254 transitions. [2022-04-08 06:27:52,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:27:52,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:27:52,590 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-08 06:27:52,590 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-08 06:27:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:27:52,593 INFO L93 Difference]: Finished difference Result 227 states and 254 transitions. [2022-04-08 06:27:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 254 transitions. [2022-04-08 06:27:52,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:27:52,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:27:52,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:27:52,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:27:52,594 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-08 06:27:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 252 transitions. [2022-04-08 06:27:52,597 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 252 transitions. Word has length 100 [2022-04-08 06:27:52,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:27:52,597 INFO L478 AbstractCegarLoop]: Abstraction has 224 states and 252 transitions. [2022-04-08 06:27:52,598 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-08 06:27:52,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 224 states and 252 transitions. [2022-04-08 06:27:54,988 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-08 06:27:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 252 transitions. [2022-04-08 06:27:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-08 06:27:54,989 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:27:54,989 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-08 06:27:55,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 06:27:55,203 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-08 06:27:55,203 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:27:55,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:27:55,204 INFO L85 PathProgramCache]: Analyzing trace with hash -543991253, now seen corresponding path program 11 times [2022-04-08 06:27:55,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:27:55,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [101760904] [2022-04-08 06:28:00,376 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:28:00,377 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:28:00,377 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:28:00,377 INFO L85 PathProgramCache]: Analyzing trace with hash -543991253, now seen corresponding path program 12 times [2022-04-08 06:28:00,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:28:00,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350526593] [2022-04-08 06:28:00,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:28:00,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:28:00,386 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:28:00,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016241544] [2022-04-08 06:28:00,386 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:28:00,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:28:00,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:28:00,387 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-08 06:28:00,388 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-08 06:28:00,507 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 06:28:00,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:28:00,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 06:28:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:28:00,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:28:02,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {25513#true} call ULTIMATE.init(); {25513#true} is VALID [2022-04-08 06:28:02,493 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-08 06:28:02,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:28:02,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25513#true} {25513#true} #96#return; {25513#true} is VALID [2022-04-08 06:28:02,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {25513#true} call #t~ret8 := main(); {25513#true} is VALID [2022-04-08 06:28:02,493 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-08 06:28:02,493 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-08 06:28:02,493 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-08 06:28:02,494 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-08 06:28:02,494 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-08 06:28:02,495 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-08 06:28:02,495 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-08 06:28:02,495 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-08 06:28:02,496 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 < 50);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-08 06:28:02,496 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-08 06:28:02,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:28:02,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:28:02,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:28:02,497 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-08 06:28:02,497 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-08 06:28:02,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:28:02,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:28:02,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:28:02,498 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-08 06:28:02,498 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-08 06:28:02,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:28:02,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:28:02,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:28:02,498 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-08 06:28:02,500 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-08 06:28:02,500 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-08 06:28:02,501 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 < 50);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-08 06:28:02,501 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-08 06:28:02,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:28:02,501 INFO L290 TraceCheckUtils]: 34: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:28:02,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:28:02,501 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-08 06:28:02,501 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-08 06:28:02,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:28:02,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:28:02,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:28:02,502 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-08 06:28:02,502 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-08 06:28:02,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {25513#true} ~cond := #in~cond; {25652#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:28:02,503 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-08 06:28:02,503 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-08 06:28:02,504 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-08 06:28:02,505 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-08 06:28:02,506 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-08 06:28:02,506 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 < 50);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-08 06:28:02,506 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-08 06:28:02,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:28:02,506 INFO L290 TraceCheckUtils]: 52: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:28:02,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:28:02,507 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-08 06:28:02,507 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-08 06:28:02,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:28:02,507 INFO L290 TraceCheckUtils]: 57: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:28:02,507 INFO L290 TraceCheckUtils]: 58: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:28:02,508 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-08 06:28:02,508 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-08 06:28:02,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:28:02,508 INFO L290 TraceCheckUtils]: 62: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:28:02,508 INFO L290 TraceCheckUtils]: 63: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:28:02,508 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-08 06:28:02,509 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-08 06:28:02,509 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-08 06:28:02,510 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 < 50);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-08 06:28:02,510 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-08 06:28:02,510 INFO L290 TraceCheckUtils]: 69: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:28:02,510 INFO L290 TraceCheckUtils]: 70: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:28:02,510 INFO L290 TraceCheckUtils]: 71: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:28:02,511 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-08 06:28:02,511 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-08 06:28:02,511 INFO L290 TraceCheckUtils]: 74: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:28:02,511 INFO L290 TraceCheckUtils]: 75: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:28:02,511 INFO L290 TraceCheckUtils]: 76: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:28:02,517 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-08 06:28:02,519 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-08 06:28:02,521 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-08 06:28:02,521 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-08 06:28:02,522 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 < 50);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-08 06:28:02,522 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-08 06:28:02,522 INFO L290 TraceCheckUtils]: 83: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:28:02,522 INFO L290 TraceCheckUtils]: 84: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:28:02,522 INFO L290 TraceCheckUtils]: 85: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:28:02,523 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-08 06:28:02,523 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-08 06:28:02,523 INFO L290 TraceCheckUtils]: 88: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:28:02,523 INFO L290 TraceCheckUtils]: 89: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:28:02,523 INFO L290 TraceCheckUtils]: 90: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:28:02,524 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-08 06:28:02,525 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-08 06:28:02,526 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-08 06:28:02,527 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-08 06:28:02,527 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 < 50);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-08 06:28:02,528 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-08 06:28:02,528 INFO L290 TraceCheckUtils]: 97: Hoare triple {25817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:28:02,529 INFO L290 TraceCheckUtils]: 98: Hoare triple {25821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25514#false} is VALID [2022-04-08 06:28:02,529 INFO L290 TraceCheckUtils]: 99: Hoare triple {25514#false} assume !false; {25514#false} is VALID [2022-04-08 06:28:02,529 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-08 06:28:02,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:29:32,491 WARN L232 SmtUtils]: Spent 23.02s 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-08 06:30:35,780 INFO L290 TraceCheckUtils]: 99: Hoare triple {25514#false} assume !false; {25514#false} is VALID [2022-04-08 06:30:35,781 INFO L290 TraceCheckUtils]: 98: Hoare triple {25821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25514#false} is VALID [2022-04-08 06:30:35,781 INFO L290 TraceCheckUtils]: 97: Hoare triple {25817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:30:35,782 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-08 06:30:35,782 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 < 50);havoc #t~post7; {25837#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:30:35,782 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-08 06:30:35,786 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-08 06:30:35,801 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-08 06:30:35,802 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-08 06:30:35,802 INFO L290 TraceCheckUtils]: 90: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:35,802 INFO L290 TraceCheckUtils]: 89: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:30:35,802 INFO L290 TraceCheckUtils]: 88: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:30:35,802 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-08 06:30:35,803 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-08 06:30:35,803 INFO L290 TraceCheckUtils]: 85: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:35,803 INFO L290 TraceCheckUtils]: 84: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:30:35,803 INFO L290 TraceCheckUtils]: 83: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:30:35,803 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-08 06:30:35,804 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 < 50);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-08 06:30:35,805 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-08 06:30:35,826 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-08 06:30:36,089 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-08 06:30:36,090 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-08 06:30:36,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:36,091 INFO L290 TraceCheckUtils]: 75: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:30:36,091 INFO L290 TraceCheckUtils]: 74: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:30:36,091 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-08 06:30:36,094 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-08 06:30:36,094 INFO L290 TraceCheckUtils]: 71: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:36,094 INFO L290 TraceCheckUtils]: 70: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:30:36,094 INFO L290 TraceCheckUtils]: 69: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:30:36,094 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-08 06:30:36,099 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 < 50);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-08 06:30:36,103 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-08 06:30:36,113 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-08 06:30:36,115 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-08 06:30:36,115 INFO L290 TraceCheckUtils]: 63: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:36,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:30:36,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:30:36,116 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-08 06:30:36,121 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-08 06:30:36,121 INFO L290 TraceCheckUtils]: 58: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:36,122 INFO L290 TraceCheckUtils]: 57: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:30:36,122 INFO L290 TraceCheckUtils]: 56: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:30:36,122 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-08 06:30:36,123 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-08 06:30:36,123 INFO L290 TraceCheckUtils]: 53: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:36,123 INFO L290 TraceCheckUtils]: 52: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:30:36,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:30:36,123 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-08 06:30:36,126 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 < 50);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-08 06:30:36,130 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-08 06:30:36,235 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-08 06:30:36,239 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-08 06:30:36,239 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-08 06:30:36,240 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-08 06:30:36,240 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-08 06:30:36,241 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-08 06:30:36,241 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-08 06:30:36,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:36,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:30:36,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:30:36,242 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-08 06:30:36,243 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-08 06:30:36,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:36,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:30:36,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:30:36,243 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-08 06:30:36,245 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 < 50);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-08 06:30:36,246 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-08 06:30:36,254 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-08 06:30:36,254 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-08 06:30:36,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:36,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:30:36,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:30:36,255 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-08 06:30:36,255 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-08 06:30:36,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:36,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:30:36,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:30:36,256 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-08 06:30:36,256 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-08 06:30:36,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:36,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:30:36,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:30:36,256 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-08 06:30:36,257 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 < 50);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-08 06:30:36,257 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-08 06:30:36,260 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-08 06:30:36,260 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25513#true} {25513#true} #80#return; {25513#true} is VALID [2022-04-08 06:30:36,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:36,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-08 06:30:36,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-08 06:30:36,260 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-08 06:30:36,260 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-08 06:30:36,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {25513#true} call #t~ret8 := main(); {25513#true} is VALID [2022-04-08 06:30:36,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25513#true} {25513#true} #96#return; {25513#true} is VALID [2022-04-08 06:30:36,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-08 06:30:36,261 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-08 06:30:36,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {25513#true} call ULTIMATE.init(); {25513#true} is VALID [2022-04-08 06:30:36,262 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-08 06:30:36,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:30:36,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350526593] [2022-04-08 06:30:36,262 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:30:36,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016241544] [2022-04-08 06:30:36,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016241544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:30:36,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:30:36,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2022-04-08 06:30:36,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:30:36,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [101760904] [2022-04-08 06:30:36,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [101760904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:30:36,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:30:36,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 06:30:36,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197463721] [2022-04-08 06:30:36,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:30:36,263 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-08 06:30:36,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:30:36,264 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-08 06:30:36,354 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-08 06:30:36,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 06:30:36,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:30:36,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 06:30:36,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-04-08 06:30:36,355 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-08 06:30:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:30:46,963 INFO L93 Difference]: Finished difference Result 237 states and 264 transitions. [2022-04-08 06:30:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 06:30:46,964 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-08 06:30:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:30:46,964 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-08 06:30:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2022-04-08 06:30:46,965 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-08 06:30:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2022-04-08 06:30:46,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 108 transitions. [2022-04-08 06:30:47,121 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-08 06:30:47,124 INFO L225 Difference]: With dead ends: 237 [2022-04-08 06:30:47,124 INFO L226 Difference]: Without dead ends: 221 [2022-04-08 06:30:47,125 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 174 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=101, Invalid=546, Unknown=3, NotChecked=0, Total=650 [2022-04-08 06:30:47,125 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 43 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:30:47,125 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 329 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-08 06:30:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-08 06:30:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-04-08 06:30:47,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:30:47,403 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-08 06:30:47,403 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-08 06:30:47,403 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-08 06:30:47,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:30:47,406 INFO L93 Difference]: Finished difference Result 221 states and 247 transitions. [2022-04-08 06:30:47,406 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 247 transitions. [2022-04-08 06:30:47,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:30:47,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:30:47,406 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-08 06:30:47,407 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-08 06:30:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:30:47,409 INFO L93 Difference]: Finished difference Result 221 states and 247 transitions. [2022-04-08 06:30:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 247 transitions. [2022-04-08 06:30:47,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:30:47,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:30:47,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:30:47,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:30:47,410 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-08 06:30:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 247 transitions. [2022-04-08 06:30:47,413 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 247 transitions. Word has length 100 [2022-04-08 06:30:47,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:30:47,413 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 247 transitions. [2022-04-08 06:30:47,413 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-08 06:30:47,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 247 transitions. [2022-04-08 06:30:49,795 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-08 06:30:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 247 transitions. [2022-04-08 06:30:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-08 06:30:49,796 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:30:49,796 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-08 06:30:49,820 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-08 06:30:49,996 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-08 06:30:49,997 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:30:49,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:30:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash -391055071, now seen corresponding path program 13 times [2022-04-08 06:30:49,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:30:49,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1411381379] [2022-04-08 06:30:53,978 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:30:53,979 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:30:53,979 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:30:53,979 INFO L85 PathProgramCache]: Analyzing trace with hash -391055071, now seen corresponding path program 14 times [2022-04-08 06:30:53,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:30:53,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605193425] [2022-04-08 06:30:53,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:30:53,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:30:53,988 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:30:53,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548614449] [2022-04-08 06:30:53,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:30:53,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:30:53,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:30:53,989 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-08 06:30:53,990 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-08 06:30:54,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:30:54,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:30:54,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 06:30:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:30:54,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:30:59,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {27499#true} call ULTIMATE.init(); {27499#true} is VALID [2022-04-08 06:30:59,075 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-08 06:30:59,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27499#true} {27499#true} #96#return; {27499#true} is VALID [2022-04-08 06:30:59,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {27499#true} call #t~ret8 := main(); {27499#true} is VALID [2022-04-08 06:30:59,076 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-08 06:30:59,076 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-08 06:30:59,076 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-08 06:30:59,076 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-08 06:30:59,077 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-08 06:30:59,077 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-08 06:30:59,077 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-08 06:30:59,078 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-08 06:30:59,078 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 < 50);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-08 06:30:59,078 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-08 06:30:59,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,079 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-08 06:30:59,079 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-08 06:30:59,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,080 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-08 06:30:59,080 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-08 06:30:59,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,080 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-08 06:30:59,082 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-08 06:30:59,082 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-08 06:30:59,082 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 < 50);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-08 06:30:59,083 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-08 06:30:59,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,083 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-08 06:30:59,083 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-08 06:30:59,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,084 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-08 06:30:59,084 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-08 06:30:59,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,084 INFO L290 TraceCheckUtils]: 44: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,084 INFO L290 TraceCheckUtils]: 45: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,085 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-08 06:30:59,086 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-08 06:30:59,087 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-08 06:30:59,087 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 < 50);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-08 06:30:59,087 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-08 06:30:59,087 INFO L290 TraceCheckUtils]: 51: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,088 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-08 06:30:59,088 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-08 06:30:59,088 INFO L290 TraceCheckUtils]: 56: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,088 INFO L290 TraceCheckUtils]: 57: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,088 INFO L290 TraceCheckUtils]: 58: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,088 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-08 06:30:59,089 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-08 06:30:59,089 INFO L290 TraceCheckUtils]: 61: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,089 INFO L290 TraceCheckUtils]: 63: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,089 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-08 06:30:59,090 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-08 06:30:59,091 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-08 06:30:59,091 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 < 50);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-08 06:30:59,091 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-08 06:30:59,091 INFO L290 TraceCheckUtils]: 69: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,091 INFO L290 TraceCheckUtils]: 70: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,091 INFO L290 TraceCheckUtils]: 71: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,092 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-08 06:30:59,092 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-08 06:30:59,092 INFO L290 TraceCheckUtils]: 74: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,092 INFO L290 TraceCheckUtils]: 75: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,092 INFO L290 TraceCheckUtils]: 76: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,093 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-08 06:30:59,093 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-08 06:30:59,093 INFO L290 TraceCheckUtils]: 79: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,093 INFO L290 TraceCheckUtils]: 80: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,093 INFO L290 TraceCheckUtils]: 81: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,093 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-08 06:30:59,094 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-08 06:30:59,094 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-08 06:30:59,095 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 < 50);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-08 06:30:59,095 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-08 06:30:59,095 INFO L290 TraceCheckUtils]: 87: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,095 INFO L290 TraceCheckUtils]: 88: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,095 INFO L290 TraceCheckUtils]: 89: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,095 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-08 06:30:59,095 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-08 06:30:59,096 INFO L290 TraceCheckUtils]: 92: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:30:59,096 INFO L290 TraceCheckUtils]: 93: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:30:59,096 INFO L290 TraceCheckUtils]: 94: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:30:59,096 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-08 06:30:59,098 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-08 06:30:59,099 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-08 06:30:59,100 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-08 06:30:59,100 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 < 50);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-08 06:30:59,101 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-08 06:30:59,101 INFO L290 TraceCheckUtils]: 101: Hoare triple {27814#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27818#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:30:59,101 INFO L290 TraceCheckUtils]: 102: Hoare triple {27818#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27500#false} is VALID [2022-04-08 06:30:59,101 INFO L290 TraceCheckUtils]: 103: Hoare triple {27500#false} assume !false; {27500#false} is VALID [2022-04-08 06:30:59,102 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-08 06:30:59,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:31:15,064 INFO L290 TraceCheckUtils]: 103: Hoare triple {27500#false} assume !false; {27500#false} is VALID [2022-04-08 06:31:15,065 INFO L290 TraceCheckUtils]: 102: Hoare triple {27818#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27500#false} is VALID [2022-04-08 06:31:15,065 INFO L290 TraceCheckUtils]: 101: Hoare triple {27814#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27818#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:31:15,066 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-08 06:31:15,067 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 < 50);havoc #t~post7; {27834#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:31:15,067 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-08 06:31:15,070 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-08 06:31:15,082 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-08 06:31:15,083 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-08 06:31:15,083 INFO L290 TraceCheckUtils]: 94: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,083 INFO L290 TraceCheckUtils]: 93: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,083 INFO L290 TraceCheckUtils]: 92: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,083 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-08 06:31:15,084 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-08 06:31:15,084 INFO L290 TraceCheckUtils]: 89: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,084 INFO L290 TraceCheckUtils]: 88: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,084 INFO L290 TraceCheckUtils]: 87: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,084 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-08 06:31:15,085 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 < 50);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-08 06:31:15,086 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-08 06:31:15,087 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-08 06:31:15,088 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-08 06:31:15,088 INFO L290 TraceCheckUtils]: 81: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,088 INFO L290 TraceCheckUtils]: 80: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,088 INFO L290 TraceCheckUtils]: 79: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,088 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-08 06:31:15,089 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-08 06:31:15,089 INFO L290 TraceCheckUtils]: 76: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,089 INFO L290 TraceCheckUtils]: 75: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,089 INFO L290 TraceCheckUtils]: 74: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,089 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-08 06:31:15,090 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-08 06:31:15,090 INFO L290 TraceCheckUtils]: 71: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,090 INFO L290 TraceCheckUtils]: 70: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,090 INFO L290 TraceCheckUtils]: 69: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,090 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-08 06:31:15,091 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 < 50);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-08 06:31:15,092 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-08 06:31:15,096 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-08 06:31:15,097 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-08 06:31:15,097 INFO L290 TraceCheckUtils]: 63: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,097 INFO L290 TraceCheckUtils]: 62: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,097 INFO L290 TraceCheckUtils]: 61: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,097 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-08 06:31:15,098 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-08 06:31:15,098 INFO L290 TraceCheckUtils]: 58: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,098 INFO L290 TraceCheckUtils]: 57: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,098 INFO L290 TraceCheckUtils]: 56: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,098 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-08 06:31:15,098 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-08 06:31:15,099 INFO L290 TraceCheckUtils]: 53: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,099 INFO L290 TraceCheckUtils]: 52: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,099 INFO L290 TraceCheckUtils]: 51: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,099 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-08 06:31:15,099 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 < 50);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-08 06:31:15,100 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-08 06:31:15,102 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-08 06:31:15,102 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-08 06:31:15,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,103 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-08 06:31:15,103 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-08 06:31:15,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,103 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-08 06:31:15,104 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-08 06:31:15,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,104 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-08 06:31:15,105 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 < 50);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-08 06:31:15,105 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-08 06:31:15,107 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-08 06:31:15,108 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-08 06:31:15,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,108 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-08 06:31:15,109 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-08 06:31:15,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,109 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-08 06:31:15,109 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-08 06:31:15,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,110 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-08 06:31:15,110 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 < 50);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-08 06:31:15,111 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-08 06:31:15,114 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-08 06:31:15,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27499#true} {27499#true} #80#return; {27499#true} is VALID [2022-04-08 06:31:15,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-08 06:31:15,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-08 06:31:15,114 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-08 06:31:15,115 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-08 06:31:15,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {27499#true} call #t~ret8 := main(); {27499#true} is VALID [2022-04-08 06:31:15,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27499#true} {27499#true} #96#return; {27499#true} is VALID [2022-04-08 06:31:15,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-08 06:31:15,115 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-08 06:31:15,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {27499#true} call ULTIMATE.init(); {27499#true} is VALID [2022-04-08 06:31:15,116 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-08 06:31:15,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:31:15,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605193425] [2022-04-08 06:31:15,116 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:31:15,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548614449] [2022-04-08 06:31:15,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548614449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:31:15,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:31:15,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2022-04-08 06:31:15,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:31:15,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1411381379] [2022-04-08 06:31:15,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1411381379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:31:15,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:31:15,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 06:31:15,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706424438] [2022-04-08 06:31:15,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:31:15,117 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-08 06:31:15,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:31:15,117 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-08 06:31:15,226 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-08 06:31:15,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 06:31:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:31:15,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 06:31:15,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-04-08 06:31:15,226 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-08 06:31:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:31:19,734 INFO L93 Difference]: Finished difference Result 280 states and 328 transitions. [2022-04-08 06:31:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 06:31:19,735 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-08 06:31:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:31:19,735 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-08 06:31:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2022-04-08 06:31:19,736 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-08 06:31:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2022-04-08 06:31:19,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 135 transitions. [2022-04-08 06:31:19,924 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-08 06:31:19,927 INFO L225 Difference]: With dead ends: 280 [2022-04-08 06:31:19,927 INFO L226 Difference]: Without dead ends: 235 [2022-04-08 06:31:19,928 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-04-08 06:31:19,928 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 39 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-08 06:31:19,928 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.9s Time] [2022-04-08 06:31:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-08 06:31:20,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2022-04-08 06:31:20,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:31:20,263 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-08 06:31:20,263 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-08 06:31:20,263 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-08 06:31:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:31:20,266 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2022-04-08 06:31:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 266 transitions. [2022-04-08 06:31:20,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:31:20,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:31:20,267 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-08 06:31:20,267 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-08 06:31:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:31:20,270 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2022-04-08 06:31:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 266 transitions. [2022-04-08 06:31:20,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:31:20,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:31:20,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:31:20,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:31:20,271 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-08 06:31:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 261 transitions. [2022-04-08 06:31:20,274 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 261 transitions. Word has length 104 [2022-04-08 06:31:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:31:20,274 INFO L478 AbstractCegarLoop]: Abstraction has 232 states and 261 transitions. [2022-04-08 06:31:20,274 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-08 06:31:20,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 232 states and 261 transitions. [2022-04-08 06:31:22,707 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-08 06:31:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 261 transitions. [2022-04-08 06:31:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-08 06:31:22,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:31:22,708 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-08 06:31:22,724 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-08 06:31:22,909 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-08 06:31:22,909 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:31:22,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:31:22,909 INFO L85 PathProgramCache]: Analyzing trace with hash 979077220, now seen corresponding path program 15 times [2022-04-08 06:31:22,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:31:22,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1251035954] [2022-04-08 06:31:28,940 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:31:28,940 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:31:28,940 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:31:28,941 INFO L85 PathProgramCache]: Analyzing trace with hash 979077220, now seen corresponding path program 16 times [2022-04-08 06:31:28,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:31:28,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116397720] [2022-04-08 06:31:28,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:31:28,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:31:28,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:31:28,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747767712] [2022-04-08 06:31:28,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:31:28,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:31:28,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:31:28,957 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-08 06:31:28,982 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-08 06:31:29,024 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:31:29,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:31:29,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 06:31:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:31:29,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:31:30,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {29641#true} call ULTIMATE.init(); {29641#true} is VALID [2022-04-08 06:31:30,037 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-08 06:31:30,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29641#true} {29641#true} #96#return; {29641#true} is VALID [2022-04-08 06:31:30,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {29641#true} call #t~ret8 := main(); {29641#true} is VALID [2022-04-08 06:31:30,038 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-08 06:31:30,038 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-08 06:31:30,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,038 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29641#true} {29641#true} #80#return; {29641#true} is VALID [2022-04-08 06:31:30,038 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-08 06:31:30,039 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-08 06:31:30,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-08 06:31:30,039 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-08 06:31:30,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,040 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-08 06:31:30,040 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-08 06:31:30,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,041 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-08 06:31:30,041 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-08 06:31:30,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,042 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-08 06:31:30,044 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-08 06:31:30,044 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-08 06:31:30,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} assume !!(#t~post6 < 50);havoc #t~post6; {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} is VALID [2022-04-08 06:31:30,045 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-08 06:31:30,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,045 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-08 06:31:30,045 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-08 06:31:30,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,046 INFO L290 TraceCheckUtils]: 40: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,046 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-08 06:31:30,046 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-08 06:31:30,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,047 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-08 06:31:30,048 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-08 06:31:30,048 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-08 06:31:30,049 INFO L290 TraceCheckUtils]: 49: Hoare triple {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} assume !!(#t~post6 < 50);havoc #t~post6; {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-08 06:31:30,049 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-08 06:31:30,049 INFO L290 TraceCheckUtils]: 51: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,049 INFO L290 TraceCheckUtils]: 52: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,050 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-08 06:31:30,050 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-08 06:31:30,050 INFO L290 TraceCheckUtils]: 56: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,050 INFO L290 TraceCheckUtils]: 57: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,050 INFO L290 TraceCheckUtils]: 58: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,050 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-08 06:31:30,050 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-08 06:31:30,050 INFO L290 TraceCheckUtils]: 61: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,051 INFO L290 TraceCheckUtils]: 62: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,051 INFO L290 TraceCheckUtils]: 63: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,051 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-08 06:31:30,053 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-08 06:31:30,054 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-08 06:31:30,054 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 < 50);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-08 06:31:30,054 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-08 06:31:30,054 INFO L290 TraceCheckUtils]: 69: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,054 INFO L290 TraceCheckUtils]: 70: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,054 INFO L290 TraceCheckUtils]: 71: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,055 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-08 06:31:30,055 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-08 06:31:30,055 INFO L290 TraceCheckUtils]: 74: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,055 INFO L290 TraceCheckUtils]: 75: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,055 INFO L290 TraceCheckUtils]: 76: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,056 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-08 06:31:30,056 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-08 06:31:30,056 INFO L290 TraceCheckUtils]: 79: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,056 INFO L290 TraceCheckUtils]: 80: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,056 INFO L290 TraceCheckUtils]: 81: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,056 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-08 06:31:30,058 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-08 06:31:30,059 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-08 06:31:30,059 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 < 50);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-08 06:31:30,059 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-08 06:31:30,059 INFO L290 TraceCheckUtils]: 87: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,060 INFO L290 TraceCheckUtils]: 88: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,060 INFO L290 TraceCheckUtils]: 89: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,060 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-08 06:31:30,060 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-08 06:31:30,060 INFO L290 TraceCheckUtils]: 92: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,060 INFO L290 TraceCheckUtils]: 93: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,060 INFO L290 TraceCheckUtils]: 94: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,061 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-08 06:31:30,062 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-08 06:31:30,063 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-08 06:31:30,063 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-08 06:31:30,064 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 < 50);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-08 06:31:30,064 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-08 06:31:30,064 INFO L290 TraceCheckUtils]: 101: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:30,064 INFO L290 TraceCheckUtils]: 102: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:30,064 INFO L290 TraceCheckUtils]: 103: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:30,064 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-08 06:31:30,065 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-08 06:31:30,065 INFO L290 TraceCheckUtils]: 106: Hoare triple {29967#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29971#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:31:30,066 INFO L290 TraceCheckUtils]: 107: Hoare triple {29971#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29642#false} is VALID [2022-04-08 06:31:30,066 INFO L290 TraceCheckUtils]: 108: Hoare triple {29642#false} assume !false; {29642#false} is VALID [2022-04-08 06:31:30,066 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-08 06:31:30,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:31:33,307 INFO L290 TraceCheckUtils]: 108: Hoare triple {29642#false} assume !false; {29642#false} is VALID [2022-04-08 06:31:33,308 INFO L290 TraceCheckUtils]: 107: Hoare triple {29971#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29642#false} is VALID [2022-04-08 06:31:33,308 INFO L290 TraceCheckUtils]: 106: Hoare triple {29967#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29971#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:31:33,308 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-08 06:31:33,309 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-08 06:31:33,309 INFO L290 TraceCheckUtils]: 103: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,309 INFO L290 TraceCheckUtils]: 102: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,309 INFO L290 TraceCheckUtils]: 101: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,309 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-08 06:31:33,309 INFO L290 TraceCheckUtils]: 99: Hoare triple {29987#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 50);havoc #t~post7; {29987#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-08 06:31:33,310 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-08 06:31:33,310 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-08 06:31:33,325 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-08 06:31:33,325 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-08 06:31:33,325 INFO L290 TraceCheckUtils]: 94: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,325 INFO L290 TraceCheckUtils]: 93: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,326 INFO L290 TraceCheckUtils]: 92: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,326 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-08 06:31:33,326 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-08 06:31:33,326 INFO L290 TraceCheckUtils]: 89: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,326 INFO L290 TraceCheckUtils]: 88: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,326 INFO L290 TraceCheckUtils]: 87: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,326 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-08 06:31:33,327 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 < 50);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-08 06:31:33,328 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-08 06:31:33,329 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-08 06:31:33,330 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-08 06:31:33,330 INFO L290 TraceCheckUtils]: 81: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,330 INFO L290 TraceCheckUtils]: 80: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,330 INFO L290 TraceCheckUtils]: 79: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,330 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-08 06:31:33,330 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-08 06:31:33,331 INFO L290 TraceCheckUtils]: 76: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,331 INFO L290 TraceCheckUtils]: 75: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,331 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-08 06:31:33,331 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-08 06:31:33,331 INFO L290 TraceCheckUtils]: 71: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,331 INFO L290 TraceCheckUtils]: 70: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,332 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-08 06:31:33,332 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 < 50);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-08 06:31:33,333 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-08 06:31:33,337 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-08 06:31:33,337 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-08 06:31:33,337 INFO L290 TraceCheckUtils]: 63: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,338 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-08 06:31:33,338 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-08 06:31:33,338 INFO L290 TraceCheckUtils]: 58: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,338 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-08 06:31:33,339 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-08 06:31:33,339 INFO L290 TraceCheckUtils]: 53: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,339 INFO L290 TraceCheckUtils]: 52: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,339 INFO L290 TraceCheckUtils]: 51: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,339 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-08 06:31:33,339 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 < 50);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-08 06:31:33,340 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-08 06:31:33,341 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-08 06:31:33,342 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-08 06:31:33,342 INFO L290 TraceCheckUtils]: 45: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,342 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-08 06:31:33,342 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-08 06:31:33,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,343 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-08 06:31:33,343 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-08 06:31:33,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,344 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-08 06:31:33,344 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 < 50);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-08 06:31:33,344 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-08 06:31:33,346 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-08 06:31:33,346 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-08 06:31:33,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,346 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-08 06:31:33,347 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-08 06:31:33,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,347 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-08 06:31:33,348 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-08 06:31:33,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,348 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-08 06:31:33,348 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 < 50);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-08 06:31:33,349 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-08 06:31:33,349 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-08 06:31:33,349 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29641#true} {29641#true} #80#return; {29641#true} is VALID [2022-04-08 06:31:33,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-08 06:31:33,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-08 06:31:33,349 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-08 06:31:33,349 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-08 06:31:33,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {29641#true} call #t~ret8 := main(); {29641#true} is VALID [2022-04-08 06:31:33,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29641#true} {29641#true} #96#return; {29641#true} is VALID [2022-04-08 06:31:33,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-08 06:31:33,350 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-08 06:31:33,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {29641#true} call ULTIMATE.init(); {29641#true} is VALID [2022-04-08 06:31:33,350 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-08 06:31:33,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:31:33,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116397720] [2022-04-08 06:31:33,351 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:31:33,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747767712] [2022-04-08 06:31:33,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747767712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:31:33,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:31:33,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-04-08 06:31:33,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:31:33,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1251035954] [2022-04-08 06:31:33,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1251035954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:31:33,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:31:33,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 06:31:33,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115086357] [2022-04-08 06:31:33,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:31:33,352 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-08 06:31:33,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:31:33,352 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-08 06:31:33,447 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-08 06:31:33,447 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 06:31:33,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:31:33,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 06:31:33,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:31:33,448 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-08 06:31:36,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:31:36,516 INFO L93 Difference]: Finished difference Result 286 states and 340 transitions. [2022-04-08 06:31:36,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 06:31:36,516 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-08 06:31:36,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:31:36,516 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-08 06:31:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2022-04-08 06:31:36,518 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-08 06:31:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2022-04-08 06:31:36,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 154 transitions. [2022-04-08 06:31:36,687 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-08 06:31:36,691 INFO L225 Difference]: With dead ends: 286 [2022-04-08 06:31:36,691 INFO L226 Difference]: Without dead ends: 256 [2022-04-08 06:31:36,692 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-04-08 06:31:36,692 INFO L913 BasicCegarLoop]: 89 mSDtfsCounter, 23 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:31:36,692 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.2s Time] [2022-04-08 06:31:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-08 06:31:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2022-04-08 06:31:36,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:31:36,997 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-08 06:31:36,997 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-08 06:31:36,997 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-08 06:31:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:31:37,001 INFO L93 Difference]: Finished difference Result 256 states and 294 transitions. [2022-04-08 06:31:37,001 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 294 transitions. [2022-04-08 06:31:37,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:31:37,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:31:37,001 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-08 06:31:37,002 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-08 06:31:37,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:31:37,005 INFO L93 Difference]: Finished difference Result 256 states and 294 transitions. [2022-04-08 06:31:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 294 transitions. [2022-04-08 06:31:37,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:31:37,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:31:37,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:31:37,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:31:37,005 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-08 06:31:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 286 transitions. [2022-04-08 06:31:37,010 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 286 transitions. Word has length 109 [2022-04-08 06:31:37,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:31:37,011 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 286 transitions. [2022-04-08 06:31:37,011 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-08 06:31:37,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 286 transitions. [2022-04-08 06:31:39,451 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-08 06:31:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 286 transitions. [2022-04-08 06:31:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 06:31:39,452 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:31:39,452 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-08 06:31:39,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 06:31:39,659 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-08 06:31:39,659 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:31:39,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:31:39,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1412827450, now seen corresponding path program 3 times [2022-04-08 06:31:39,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:31:39,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1678693942] [2022-04-08 06:31:45,396 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:31:45,397 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:31:45,397 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:31:45,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1412827450, now seen corresponding path program 4 times [2022-04-08 06:31:45,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:31:45,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596362164] [2022-04-08 06:31:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:31:45,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:31:45,408 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:31:45,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889466863] [2022-04-08 06:31:45,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:31:45,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:31:45,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:31:45,410 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-08 06:31:45,410 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-08 06:31:45,471 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:31:45,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:31:45,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 06:31:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:31:45,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:31:54,883 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:31:55,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {31896#true} call ULTIMATE.init(); {31896#true} is VALID [2022-04-08 06:31:55,026 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-08 06:31:55,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31896#true} {31896#true} #96#return; {31896#true} is VALID [2022-04-08 06:31:55,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {31896#true} call #t~ret8 := main(); {31896#true} is VALID [2022-04-08 06:31:55,027 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-08 06:31:55,027 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-08 06:31:55,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,027 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31896#true} {31896#true} #80#return; {31896#true} is VALID [2022-04-08 06:31:55,027 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-08 06:31:55,028 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-08 06:31:55,028 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 < 50);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-08 06:31:55,028 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-08 06:31:55,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,029 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-08 06:31:55,029 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-08 06:31:55,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,030 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-08 06:31:55,030 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-08 06:31:55,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,030 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-08 06:31:55,032 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-08 06:31:55,033 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-08 06:31:55,033 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 < 50);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-08 06:31:55,033 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-08 06:31:55,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,034 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-08 06:31:55,034 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-08 06:31:55,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,034 INFO L290 TraceCheckUtils]: 39: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,034 INFO L290 TraceCheckUtils]: 40: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,035 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-08 06:31:55,035 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-08 06:31:55,035 INFO L290 TraceCheckUtils]: 43: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,035 INFO L290 TraceCheckUtils]: 44: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,036 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-08 06:31:55,038 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-08 06:31:55,038 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-08 06:31:55,039 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 < 50);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-08 06:31:55,039 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-08 06:31:55,039 INFO L290 TraceCheckUtils]: 51: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,039 INFO L290 TraceCheckUtils]: 52: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,039 INFO L290 TraceCheckUtils]: 53: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,039 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-08 06:31:55,040 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-08 06:31:55,040 INFO L290 TraceCheckUtils]: 56: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,040 INFO L290 TraceCheckUtils]: 57: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,040 INFO L290 TraceCheckUtils]: 58: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,040 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-08 06:31:55,040 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-08 06:31:55,040 INFO L290 TraceCheckUtils]: 61: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,041 INFO L290 TraceCheckUtils]: 62: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,041 INFO L290 TraceCheckUtils]: 63: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,041 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-08 06:31:55,042 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-08 06:31:55,042 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-08 06:31:55,043 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 < 50);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-08 06:31:55,043 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-08 06:31:55,043 INFO L290 TraceCheckUtils]: 69: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,043 INFO L290 TraceCheckUtils]: 70: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,043 INFO L290 TraceCheckUtils]: 71: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,043 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-08 06:31:55,043 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-08 06:31:55,044 INFO L290 TraceCheckUtils]: 74: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,044 INFO L290 TraceCheckUtils]: 75: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,044 INFO L290 TraceCheckUtils]: 76: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,044 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-08 06:31:55,046 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-08 06:31:55,050 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-08 06:31:55,050 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-08 06:31:55,051 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 < 50);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-08 06:31:55,051 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-08 06:31:55,051 INFO L290 TraceCheckUtils]: 83: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,051 INFO L290 TraceCheckUtils]: 84: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,051 INFO L290 TraceCheckUtils]: 85: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,052 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-08 06:31:55,052 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-08 06:31:55,052 INFO L290 TraceCheckUtils]: 88: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,052 INFO L290 TraceCheckUtils]: 89: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,052 INFO L290 TraceCheckUtils]: 90: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,052 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-08 06:31:55,057 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-08 06:31:55,064 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-08 06:31:55,066 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-08 06:31:55,067 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 < 50);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-08 06:31:55,067 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-08 06:31:55,067 INFO L290 TraceCheckUtils]: 97: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,067 INFO L290 TraceCheckUtils]: 98: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,067 INFO L290 TraceCheckUtils]: 99: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,068 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-08 06:31:55,068 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-08 06:31:55,068 INFO L290 TraceCheckUtils]: 102: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-08 06:31:55,068 INFO L290 TraceCheckUtils]: 103: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-08 06:31:55,068 INFO L290 TraceCheckUtils]: 104: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-08 06:31:55,069 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-08 06:31:55,072 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-08 06:31:55,238 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-08 06:31:55,239 INFO L290 TraceCheckUtils]: 108: Hoare triple {32231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:31:55,239 INFO L290 TraceCheckUtils]: 109: Hoare triple {32235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31897#false} is VALID [2022-04-08 06:31:55,239 INFO L290 TraceCheckUtils]: 110: Hoare triple {31897#false} assume !false; {31897#false} is VALID [2022-04-08 06:31:55,240 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-08 06:31:55,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:32:45,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:32:45,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596362164] [2022-04-08 06:32:45,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:32:45,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889466863] [2022-04-08 06:32:45,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889466863] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 06:32:45,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 06:32:45,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 06:32:45,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:32:45,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1678693942] [2022-04-08 06:32:45,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1678693942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:32:45,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:32:45,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 06:32:45,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768860147] [2022-04-08 06:32:45,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:32:45,700 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-08 06:32:45,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:32:45,700 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-08 06:32:45,985 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-08 06:32:45,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 06:32:45,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:32:45,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 06:32:45,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-04-08 06:32:45,986 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-08 06:32:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:32:53,448 INFO L93 Difference]: Finished difference Result 258 states and 293 transitions. [2022-04-08 06:32:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 06:32:53,448 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-08 06:32:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:32:53,449 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-08 06:32:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-04-08 06:32:53,450 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-08 06:32:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-04-08 06:32:53,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 99 transitions. [2022-04-08 06:32:53,763 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-08 06:32:53,766 INFO L225 Difference]: With dead ends: 258 [2022-04-08 06:32:53,766 INFO L226 Difference]: Without dead ends: 210 [2022-04-08 06:32:53,766 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-08 06:32:53,767 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 9 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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, 4.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:32:53,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 437 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-08 06:32:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-08 06:32:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-04-08 06:32:54,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:32:54,017 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-08 06:32:54,017 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-08 06:32:54,017 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-08 06:32:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:32:54,020 INFO L93 Difference]: Finished difference Result 210 states and 245 transitions. [2022-04-08 06:32:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 245 transitions. [2022-04-08 06:32:54,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:32:54,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:32:54,020 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-08 06:32:54,020 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-08 06:32:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:32:54,023 INFO L93 Difference]: Finished difference Result 210 states and 245 transitions. [2022-04-08 06:32:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 245 transitions. [2022-04-08 06:32:54,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:32:54,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:32:54,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:32:54,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:32:54,023 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-08 06:32:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 245 transitions. [2022-04-08 06:32:54,026 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 245 transitions. Word has length 111 [2022-04-08 06:32:54,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:32:54,026 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 245 transitions. [2022-04-08 06:32:54,027 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-08 06:32:54,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 210 states and 245 transitions. [2022-04-08 06:32:56,519 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-08 06:32:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 245 transitions. [2022-04-08 06:32:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-08 06:32:56,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:32:56,520 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-08 06:32:56,539 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-08 06:32:56,736 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-08 06:32:56,736 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:32:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:32:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash 898486511, now seen corresponding path program 9 times [2022-04-08 06:32:56,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:32:56,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [93898835] [2022-04-08 06:33:05,029 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:33:05,029 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:33:05,029 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:33:05,030 INFO L85 PathProgramCache]: Analyzing trace with hash 898486511, now seen corresponding path program 10 times [2022-04-08 06:33:05,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:33:05,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068357098] [2022-04-08 06:33:05,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:33:05,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:33:05,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:33:05,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346465249] [2022-04-08 06:33:05,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:33:05,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:33:05,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:33:05,039 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-08 06:33:05,040 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-08 06:33:05,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:33:05,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:33:05,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 06:33:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:33:05,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:33:05,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {33711#true} call ULTIMATE.init(); {33711#true} is VALID [2022-04-08 06:33:05,513 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-08 06:33:05,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {33719#(<= ~counter~0 0)} assume true; {33719#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:05,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33719#(<= ~counter~0 0)} {33711#true} #96#return; {33719#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:05,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {33719#(<= ~counter~0 0)} call #t~ret8 := main(); {33719#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:05,514 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-08 06:33:05,514 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-08 06:33:05,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {33719#(<= ~counter~0 0)} ~cond := #in~cond; {33719#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:05,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {33719#(<= ~counter~0 0)} assume !(0 == ~cond); {33719#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:05,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {33719#(<= ~counter~0 0)} assume true; {33719#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:05,515 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33719#(<= ~counter~0 0)} {33719#(<= ~counter~0 0)} #80#return; {33719#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:05,515 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-08 06:33:05,516 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-08 06:33:05,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {33753#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {33753#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:05,517 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-08 06:33:05,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {33753#(<= ~counter~0 1)} ~cond := #in~cond; {33753#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:05,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {33753#(<= ~counter~0 1)} assume !(0 == ~cond); {33753#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:05,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {33753#(<= ~counter~0 1)} assume true; {33753#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:05,518 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {33753#(<= ~counter~0 1)} {33753#(<= ~counter~0 1)} #82#return; {33753#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:05,518 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-08 06:33:05,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {33753#(<= ~counter~0 1)} ~cond := #in~cond; {33753#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:05,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {33753#(<= ~counter~0 1)} assume !(0 == ~cond); {33753#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:05,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {33753#(<= ~counter~0 1)} assume true; {33753#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:05,520 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {33753#(<= ~counter~0 1)} {33753#(<= ~counter~0 1)} #84#return; {33753#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:05,520 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-08 06:33:05,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {33753#(<= ~counter~0 1)} ~cond := #in~cond; {33753#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:05,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {33753#(<= ~counter~0 1)} assume !(0 == ~cond); {33753#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:05,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {33753#(<= ~counter~0 1)} assume true; {33753#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:05,521 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {33753#(<= ~counter~0 1)} {33753#(<= ~counter~0 1)} #86#return; {33753#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:05,521 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-08 06:33:05,522 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-08 06:33:05,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {33808#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {33808#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:05,523 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-08 06:33:05,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {33808#(<= ~counter~0 2)} ~cond := #in~cond; {33808#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:05,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {33808#(<= ~counter~0 2)} assume !(0 == ~cond); {33808#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:05,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {33808#(<= ~counter~0 2)} assume true; {33808#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:05,524 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {33808#(<= ~counter~0 2)} {33808#(<= ~counter~0 2)} #82#return; {33808#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:05,524 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-08 06:33:05,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {33808#(<= ~counter~0 2)} ~cond := #in~cond; {33808#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:05,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {33808#(<= ~counter~0 2)} assume !(0 == ~cond); {33808#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:05,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {33808#(<= ~counter~0 2)} assume true; {33808#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:05,525 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {33808#(<= ~counter~0 2)} {33808#(<= ~counter~0 2)} #84#return; {33808#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:05,526 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-08 06:33:05,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {33808#(<= ~counter~0 2)} ~cond := #in~cond; {33808#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:05,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {33808#(<= ~counter~0 2)} assume !(0 == ~cond); {33808#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:05,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {33808#(<= ~counter~0 2)} assume true; {33808#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:05,527 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {33808#(<= ~counter~0 2)} {33808#(<= ~counter~0 2)} #86#return; {33808#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:05,527 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-08 06:33:05,528 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-08 06:33:05,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {33863#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {33863#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:05,528 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-08 06:33:05,528 INFO L290 TraceCheckUtils]: 51: Hoare triple {33863#(<= ~counter~0 3)} ~cond := #in~cond; {33863#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:05,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {33863#(<= ~counter~0 3)} assume !(0 == ~cond); {33863#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:05,529 INFO L290 TraceCheckUtils]: 53: Hoare triple {33863#(<= ~counter~0 3)} assume true; {33863#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:05,529 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {33863#(<= ~counter~0 3)} {33863#(<= ~counter~0 3)} #82#return; {33863#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:05,530 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-08 06:33:05,530 INFO L290 TraceCheckUtils]: 56: Hoare triple {33863#(<= ~counter~0 3)} ~cond := #in~cond; {33863#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:05,530 INFO L290 TraceCheckUtils]: 57: Hoare triple {33863#(<= ~counter~0 3)} assume !(0 == ~cond); {33863#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:05,530 INFO L290 TraceCheckUtils]: 58: Hoare triple {33863#(<= ~counter~0 3)} assume true; {33863#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:05,531 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {33863#(<= ~counter~0 3)} {33863#(<= ~counter~0 3)} #84#return; {33863#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:05,531 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-08 06:33:05,531 INFO L290 TraceCheckUtils]: 61: Hoare triple {33863#(<= ~counter~0 3)} ~cond := #in~cond; {33863#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:05,532 INFO L290 TraceCheckUtils]: 62: Hoare triple {33863#(<= ~counter~0 3)} assume !(0 == ~cond); {33863#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:05,532 INFO L290 TraceCheckUtils]: 63: Hoare triple {33863#(<= ~counter~0 3)} assume true; {33863#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:05,532 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {33863#(<= ~counter~0 3)} {33863#(<= ~counter~0 3)} #86#return; {33863#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:05,533 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-08 06:33:05,533 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-08 06:33:05,533 INFO L290 TraceCheckUtils]: 67: Hoare triple {33918#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {33918#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:05,534 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-08 06:33:05,534 INFO L290 TraceCheckUtils]: 69: Hoare triple {33918#(<= ~counter~0 4)} ~cond := #in~cond; {33918#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:05,534 INFO L290 TraceCheckUtils]: 70: Hoare triple {33918#(<= ~counter~0 4)} assume !(0 == ~cond); {33918#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:05,535 INFO L290 TraceCheckUtils]: 71: Hoare triple {33918#(<= ~counter~0 4)} assume true; {33918#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:05,535 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {33918#(<= ~counter~0 4)} {33918#(<= ~counter~0 4)} #82#return; {33918#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:05,535 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-08 06:33:05,536 INFO L290 TraceCheckUtils]: 74: Hoare triple {33918#(<= ~counter~0 4)} ~cond := #in~cond; {33918#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:05,536 INFO L290 TraceCheckUtils]: 75: Hoare triple {33918#(<= ~counter~0 4)} assume !(0 == ~cond); {33918#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:05,536 INFO L290 TraceCheckUtils]: 76: Hoare triple {33918#(<= ~counter~0 4)} assume true; {33918#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:05,536 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {33918#(<= ~counter~0 4)} {33918#(<= ~counter~0 4)} #84#return; {33918#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:05,537 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-08 06:33:05,537 INFO L290 TraceCheckUtils]: 79: Hoare triple {33918#(<= ~counter~0 4)} ~cond := #in~cond; {33918#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:05,537 INFO L290 TraceCheckUtils]: 80: Hoare triple {33918#(<= ~counter~0 4)} assume !(0 == ~cond); {33918#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:05,538 INFO L290 TraceCheckUtils]: 81: Hoare triple {33918#(<= ~counter~0 4)} assume true; {33918#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:05,538 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {33918#(<= ~counter~0 4)} {33918#(<= ~counter~0 4)} #86#return; {33918#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:05,538 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-08 06:33:05,539 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-08 06:33:05,539 INFO L290 TraceCheckUtils]: 85: Hoare triple {33973#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {33973#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:05,539 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-08 06:33:05,540 INFO L290 TraceCheckUtils]: 87: Hoare triple {33973#(<= ~counter~0 5)} ~cond := #in~cond; {33973#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:05,540 INFO L290 TraceCheckUtils]: 88: Hoare triple {33973#(<= ~counter~0 5)} assume !(0 == ~cond); {33973#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:05,540 INFO L290 TraceCheckUtils]: 89: Hoare triple {33973#(<= ~counter~0 5)} assume true; {33973#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:05,540 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {33973#(<= ~counter~0 5)} {33973#(<= ~counter~0 5)} #82#return; {33973#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:05,541 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-08 06:33:05,541 INFO L290 TraceCheckUtils]: 92: Hoare triple {33973#(<= ~counter~0 5)} ~cond := #in~cond; {33973#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:05,541 INFO L290 TraceCheckUtils]: 93: Hoare triple {33973#(<= ~counter~0 5)} assume !(0 == ~cond); {33973#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:05,542 INFO L290 TraceCheckUtils]: 94: Hoare triple {33973#(<= ~counter~0 5)} assume true; {33973#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:05,542 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {33973#(<= ~counter~0 5)} {33973#(<= ~counter~0 5)} #84#return; {33973#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:05,542 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-08 06:33:05,543 INFO L290 TraceCheckUtils]: 97: Hoare triple {33973#(<= ~counter~0 5)} ~cond := #in~cond; {33973#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:05,543 INFO L290 TraceCheckUtils]: 98: Hoare triple {33973#(<= ~counter~0 5)} assume !(0 == ~cond); {33973#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:05,543 INFO L290 TraceCheckUtils]: 99: Hoare triple {33973#(<= ~counter~0 5)} assume true; {33973#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:05,544 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {33973#(<= ~counter~0 5)} {33973#(<= ~counter~0 5)} #86#return; {33973#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:05,544 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-08 06:33:05,544 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-08 06:33:05,544 INFO L290 TraceCheckUtils]: 103: Hoare triple {34028#(<= |main_#t~post6| 5)} assume !(#t~post6 < 50);havoc #t~post6; {33712#false} is VALID [2022-04-08 06:33:05,545 INFO L290 TraceCheckUtils]: 104: Hoare triple {33712#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33712#false} is VALID [2022-04-08 06:33:05,545 INFO L290 TraceCheckUtils]: 105: Hoare triple {33712#false} assume !(#t~post7 < 50);havoc #t~post7; {33712#false} is VALID [2022-04-08 06:33:05,545 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-08 06:33:05,545 INFO L290 TraceCheckUtils]: 107: Hoare triple {33712#false} ~cond := #in~cond; {33712#false} is VALID [2022-04-08 06:33:05,545 INFO L290 TraceCheckUtils]: 108: Hoare triple {33712#false} assume !(0 == ~cond); {33712#false} is VALID [2022-04-08 06:33:05,545 INFO L290 TraceCheckUtils]: 109: Hoare triple {33712#false} assume true; {33712#false} is VALID [2022-04-08 06:33:05,545 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {33712#false} {33712#false} #92#return; {33712#false} is VALID [2022-04-08 06:33:05,545 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-08 06:33:05,545 INFO L290 TraceCheckUtils]: 112: Hoare triple {33712#false} ~cond := #in~cond; {33712#false} is VALID [2022-04-08 06:33:05,545 INFO L290 TraceCheckUtils]: 113: Hoare triple {33712#false} assume 0 == ~cond; {33712#false} is VALID [2022-04-08 06:33:05,545 INFO L290 TraceCheckUtils]: 114: Hoare triple {33712#false} assume !false; {33712#false} is VALID [2022-04-08 06:33:05,546 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-08 06:33:05,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:33:05,984 INFO L290 TraceCheckUtils]: 114: Hoare triple {33712#false} assume !false; {33712#false} is VALID [2022-04-08 06:33:05,984 INFO L290 TraceCheckUtils]: 113: Hoare triple {33712#false} assume 0 == ~cond; {33712#false} is VALID [2022-04-08 06:33:05,984 INFO L290 TraceCheckUtils]: 112: Hoare triple {33712#false} ~cond := #in~cond; {33712#false} is VALID [2022-04-08 06:33:05,984 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-08 06:33:05,984 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {33711#true} {33712#false} #92#return; {33712#false} is VALID [2022-04-08 06:33:05,984 INFO L290 TraceCheckUtils]: 109: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,984 INFO L290 TraceCheckUtils]: 108: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,984 INFO L290 TraceCheckUtils]: 107: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,984 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-08 06:33:05,984 INFO L290 TraceCheckUtils]: 105: Hoare triple {33712#false} assume !(#t~post7 < 50);havoc #t~post7; {33712#false} is VALID [2022-04-08 06:33:05,984 INFO L290 TraceCheckUtils]: 104: Hoare triple {33712#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33712#false} is VALID [2022-04-08 06:33:05,985 INFO L290 TraceCheckUtils]: 103: Hoare triple {34098#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {33712#false} is VALID [2022-04-08 06:33:05,985 INFO L290 TraceCheckUtils]: 102: Hoare triple {34102#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34098#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:33:05,985 INFO L290 TraceCheckUtils]: 101: Hoare triple {34102#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {34102#(< ~counter~0 50)} is VALID [2022-04-08 06:33:05,986 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {33711#true} {34102#(< ~counter~0 50)} #86#return; {34102#(< ~counter~0 50)} is VALID [2022-04-08 06:33:05,986 INFO L290 TraceCheckUtils]: 99: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,986 INFO L290 TraceCheckUtils]: 98: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,986 INFO L290 TraceCheckUtils]: 97: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,986 INFO L272 TraceCheckUtils]: 96: Hoare triple {34102#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:05,986 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {33711#true} {34102#(< ~counter~0 50)} #84#return; {34102#(< ~counter~0 50)} is VALID [2022-04-08 06:33:05,987 INFO L290 TraceCheckUtils]: 94: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,987 INFO L290 TraceCheckUtils]: 93: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,987 INFO L290 TraceCheckUtils]: 92: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,987 INFO L272 TraceCheckUtils]: 91: Hoare triple {34102#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:05,987 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {33711#true} {34102#(< ~counter~0 50)} #82#return; {34102#(< ~counter~0 50)} is VALID [2022-04-08 06:33:05,987 INFO L290 TraceCheckUtils]: 89: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,987 INFO L290 TraceCheckUtils]: 88: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,987 INFO L290 TraceCheckUtils]: 87: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,987 INFO L272 TraceCheckUtils]: 86: Hoare triple {34102#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:05,988 INFO L290 TraceCheckUtils]: 85: Hoare triple {34102#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {34102#(< ~counter~0 50)} is VALID [2022-04-08 06:33:05,989 INFO L290 TraceCheckUtils]: 84: Hoare triple {34157#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34102#(< ~counter~0 50)} is VALID [2022-04-08 06:33:05,989 INFO L290 TraceCheckUtils]: 83: Hoare triple {34157#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {34157#(< ~counter~0 49)} is VALID [2022-04-08 06:33:05,989 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {33711#true} {34157#(< ~counter~0 49)} #86#return; {34157#(< ~counter~0 49)} is VALID [2022-04-08 06:33:05,989 INFO L290 TraceCheckUtils]: 81: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,989 INFO L290 TraceCheckUtils]: 80: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,989 INFO L290 TraceCheckUtils]: 79: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,989 INFO L272 TraceCheckUtils]: 78: Hoare triple {34157#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:05,990 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {33711#true} {34157#(< ~counter~0 49)} #84#return; {34157#(< ~counter~0 49)} is VALID [2022-04-08 06:33:05,990 INFO L290 TraceCheckUtils]: 76: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,990 INFO L290 TraceCheckUtils]: 75: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,990 INFO L290 TraceCheckUtils]: 74: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,990 INFO L272 TraceCheckUtils]: 73: Hoare triple {34157#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:05,990 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {33711#true} {34157#(< ~counter~0 49)} #82#return; {34157#(< ~counter~0 49)} is VALID [2022-04-08 06:33:05,991 INFO L290 TraceCheckUtils]: 71: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,991 INFO L290 TraceCheckUtils]: 70: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,991 INFO L290 TraceCheckUtils]: 69: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,991 INFO L272 TraceCheckUtils]: 68: Hoare triple {34157#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:05,991 INFO L290 TraceCheckUtils]: 67: Hoare triple {34157#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {34157#(< ~counter~0 49)} is VALID [2022-04-08 06:33:05,992 INFO L290 TraceCheckUtils]: 66: Hoare triple {34212#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34157#(< ~counter~0 49)} is VALID [2022-04-08 06:33:05,992 INFO L290 TraceCheckUtils]: 65: Hoare triple {34212#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {34212#(< ~counter~0 48)} is VALID [2022-04-08 06:33:05,992 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {33711#true} {34212#(< ~counter~0 48)} #86#return; {34212#(< ~counter~0 48)} is VALID [2022-04-08 06:33:05,992 INFO L290 TraceCheckUtils]: 63: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,992 INFO L290 TraceCheckUtils]: 61: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,993 INFO L272 TraceCheckUtils]: 60: Hoare triple {34212#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:05,993 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {33711#true} {34212#(< ~counter~0 48)} #84#return; {34212#(< ~counter~0 48)} is VALID [2022-04-08 06:33:05,993 INFO L290 TraceCheckUtils]: 58: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,993 INFO L290 TraceCheckUtils]: 57: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,993 INFO L290 TraceCheckUtils]: 56: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,993 INFO L272 TraceCheckUtils]: 55: Hoare triple {34212#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:05,994 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {33711#true} {34212#(< ~counter~0 48)} #82#return; {34212#(< ~counter~0 48)} is VALID [2022-04-08 06:33:05,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,994 INFO L290 TraceCheckUtils]: 52: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,994 INFO L290 TraceCheckUtils]: 51: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,994 INFO L272 TraceCheckUtils]: 50: Hoare triple {34212#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:05,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {34212#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {34212#(< ~counter~0 48)} is VALID [2022-04-08 06:33:05,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {34267#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34212#(< ~counter~0 48)} is VALID [2022-04-08 06:33:05,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {34267#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {34267#(< ~counter~0 47)} is VALID [2022-04-08 06:33:05,995 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {33711#true} {34267#(< ~counter~0 47)} #86#return; {34267#(< ~counter~0 47)} is VALID [2022-04-08 06:33:05,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,996 INFO L290 TraceCheckUtils]: 43: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,996 INFO L272 TraceCheckUtils]: 42: Hoare triple {34267#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:05,996 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {33711#true} {34267#(< ~counter~0 47)} #84#return; {34267#(< ~counter~0 47)} is VALID [2022-04-08 06:33:05,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,996 INFO L290 TraceCheckUtils]: 38: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,996 INFO L272 TraceCheckUtils]: 37: Hoare triple {34267#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:05,997 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {33711#true} {34267#(< ~counter~0 47)} #82#return; {34267#(< ~counter~0 47)} is VALID [2022-04-08 06:33:05,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,997 INFO L272 TraceCheckUtils]: 32: Hoare triple {34267#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:05,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {34267#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {34267#(< ~counter~0 47)} is VALID [2022-04-08 06:33:05,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {34322#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34267#(< ~counter~0 47)} is VALID [2022-04-08 06:33:05,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {34322#(< ~counter~0 46)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {34322#(< ~counter~0 46)} is VALID [2022-04-08 06:33:05,998 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {33711#true} {34322#(< ~counter~0 46)} #86#return; {34322#(< ~counter~0 46)} is VALID [2022-04-08 06:33:05,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,999 INFO L272 TraceCheckUtils]: 24: Hoare triple {34322#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:05,999 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {33711#true} {34322#(< ~counter~0 46)} #84#return; {34322#(< ~counter~0 46)} is VALID [2022-04-08 06:33:05,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:05,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:05,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:05,999 INFO L272 TraceCheckUtils]: 19: Hoare triple {34322#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:06,000 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {33711#true} {34322#(< ~counter~0 46)} #82#return; {34322#(< ~counter~0 46)} is VALID [2022-04-08 06:33:06,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:06,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:06,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:06,000 INFO L272 TraceCheckUtils]: 14: Hoare triple {34322#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:06,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {34322#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {34322#(< ~counter~0 46)} is VALID [2022-04-08 06:33:06,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {34377#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34322#(< ~counter~0 46)} is VALID [2022-04-08 06:33:06,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {34377#(< ~counter~0 45)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {34377#(< ~counter~0 45)} is VALID [2022-04-08 06:33:06,001 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33711#true} {34377#(< ~counter~0 45)} #80#return; {34377#(< ~counter~0 45)} is VALID [2022-04-08 06:33:06,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-08 06:33:06,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-08 06:33:06,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-08 06:33:06,002 INFO L272 TraceCheckUtils]: 6: Hoare triple {34377#(< ~counter~0 45)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {33711#true} is VALID [2022-04-08 06:33:06,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {34377#(< ~counter~0 45)} 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 45)} is VALID [2022-04-08 06:33:06,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {34377#(< ~counter~0 45)} call #t~ret8 := main(); {34377#(< ~counter~0 45)} is VALID [2022-04-08 06:33:06,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34377#(< ~counter~0 45)} {33711#true} #96#return; {34377#(< ~counter~0 45)} is VALID [2022-04-08 06:33:06,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {34377#(< ~counter~0 45)} assume true; {34377#(< ~counter~0 45)} is VALID [2022-04-08 06:33:06,003 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 45)} is VALID [2022-04-08 06:33:06,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {33711#true} call ULTIMATE.init(); {33711#true} is VALID [2022-04-08 06:33:06,004 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-08 06:33:06,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:33:06,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068357098] [2022-04-08 06:33:06,004 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:33:06,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346465249] [2022-04-08 06:33:06,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346465249] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:33:06,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:33:06,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 06:33:06,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:33:06,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [93898835] [2022-04-08 06:33:06,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [93898835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:33:06,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:33:06,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:33:06,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050384836] [2022-04-08 06:33:06,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:33:06,005 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-08 06:33:06,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:33:06,010 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-08 06:33:06,129 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-08 06:33:06,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:33:06,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:33:06,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:33:06,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 06:33:06,130 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-08 06:33:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:33:06,872 INFO L93 Difference]: Finished difference Result 255 states and 307 transitions. [2022-04-08 06:33:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 06:33:06,872 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-08 06:33:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:33:06,872 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-08 06:33:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2022-04-08 06:33:06,873 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-08 06:33:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2022-04-08 06:33:06,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 135 transitions. [2022-04-08 06:33:07,021 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-08 06:33:07,025 INFO L225 Difference]: With dead ends: 255 [2022-04-08 06:33:07,026 INFO L226 Difference]: Without dead ends: 212 [2022-04-08 06:33:07,026 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-08 06:33:07,035 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 15 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:33:07,035 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.1s Time] [2022-04-08 06:33:07,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-08 06:33:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-04-08 06:33:07,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:33:07,312 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-08 06:33:07,312 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-08 06:33:07,313 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-08 06:33:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:33:07,315 INFO L93 Difference]: Finished difference Result 212 states and 247 transitions. [2022-04-08 06:33:07,315 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 247 transitions. [2022-04-08 06:33:07,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:33:07,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:33:07,316 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-08 06:33:07,316 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-08 06:33:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:33:07,319 INFO L93 Difference]: Finished difference Result 212 states and 247 transitions. [2022-04-08 06:33:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 247 transitions. [2022-04-08 06:33:07,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:33:07,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:33:07,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:33:07,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:33:07,319 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-08 06:33:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 247 transitions. [2022-04-08 06:33:07,322 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 247 transitions. Word has length 115 [2022-04-08 06:33:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:33:07,323 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 247 transitions. [2022-04-08 06:33:07,323 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-08 06:33:07,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 247 transitions. [2022-04-08 06:33:09,764 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-08 06:33:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 247 transitions. [2022-04-08 06:33:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 06:33:09,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:33:09,765 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-08 06:33:09,781 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-08 06:33:09,972 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-08 06:33:09,973 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:33:09,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:33:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1562534599, now seen corresponding path program 7 times [2022-04-08 06:33:09,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:33:09,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1579513161] [2022-04-08 06:33:18,294 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:33:18,294 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:33:18,294 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:33:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1562534599, now seen corresponding path program 8 times [2022-04-08 06:33:18,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:33:18,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788282704] [2022-04-08 06:33:18,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:33:18,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:33:18,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:33:18,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1172938388] [2022-04-08 06:33:18,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:33:18,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:33:18,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:33:18,305 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-08 06:33:18,306 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-08 06:33:18,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:33:18,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:33:18,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:33:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:33:18,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:33:18,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {35784#true} call ULTIMATE.init(); {35784#true} is VALID [2022-04-08 06:33:18,854 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-08 06:33:18,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {35792#(<= ~counter~0 0)} assume true; {35792#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:18,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35792#(<= ~counter~0 0)} {35784#true} #96#return; {35792#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:18,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {35792#(<= ~counter~0 0)} call #t~ret8 := main(); {35792#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:18,855 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-08 06:33:18,855 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-08 06:33:18,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {35792#(<= ~counter~0 0)} ~cond := #in~cond; {35792#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:18,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {35792#(<= ~counter~0 0)} assume !(0 == ~cond); {35792#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:18,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {35792#(<= ~counter~0 0)} assume true; {35792#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:18,856 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35792#(<= ~counter~0 0)} {35792#(<= ~counter~0 0)} #80#return; {35792#(<= ~counter~0 0)} is VALID [2022-04-08 06:33:18,857 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-08 06:33:18,858 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-08 06:33:18,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {35826#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {35826#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:18,859 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-08 06:33:18,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {35826#(<= ~counter~0 1)} ~cond := #in~cond; {35826#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:18,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {35826#(<= ~counter~0 1)} assume !(0 == ~cond); {35826#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:18,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {35826#(<= ~counter~0 1)} assume true; {35826#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:18,860 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {35826#(<= ~counter~0 1)} {35826#(<= ~counter~0 1)} #82#return; {35826#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:18,861 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-08 06:33:18,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {35826#(<= ~counter~0 1)} ~cond := #in~cond; {35826#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:18,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {35826#(<= ~counter~0 1)} assume !(0 == ~cond); {35826#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:18,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {35826#(<= ~counter~0 1)} assume true; {35826#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:18,863 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {35826#(<= ~counter~0 1)} {35826#(<= ~counter~0 1)} #84#return; {35826#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:18,863 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-08 06:33:18,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {35826#(<= ~counter~0 1)} ~cond := #in~cond; {35826#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:18,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {35826#(<= ~counter~0 1)} assume !(0 == ~cond); {35826#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:18,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {35826#(<= ~counter~0 1)} assume true; {35826#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:18,864 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {35826#(<= ~counter~0 1)} {35826#(<= ~counter~0 1)} #86#return; {35826#(<= ~counter~0 1)} is VALID [2022-04-08 06:33:18,865 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-08 06:33:18,866 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-08 06:33:18,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {35881#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {35881#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:18,866 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-08 06:33:18,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {35881#(<= ~counter~0 2)} ~cond := #in~cond; {35881#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:18,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {35881#(<= ~counter~0 2)} assume !(0 == ~cond); {35881#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:18,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {35881#(<= ~counter~0 2)} assume true; {35881#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:18,867 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35881#(<= ~counter~0 2)} {35881#(<= ~counter~0 2)} #82#return; {35881#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:18,868 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-08 06:33:18,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {35881#(<= ~counter~0 2)} ~cond := #in~cond; {35881#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:18,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {35881#(<= ~counter~0 2)} assume !(0 == ~cond); {35881#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:18,869 INFO L290 TraceCheckUtils]: 40: Hoare triple {35881#(<= ~counter~0 2)} assume true; {35881#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:18,869 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35881#(<= ~counter~0 2)} {35881#(<= ~counter~0 2)} #84#return; {35881#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:18,870 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-08 06:33:18,870 INFO L290 TraceCheckUtils]: 43: Hoare triple {35881#(<= ~counter~0 2)} ~cond := #in~cond; {35881#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:18,870 INFO L290 TraceCheckUtils]: 44: Hoare triple {35881#(<= ~counter~0 2)} assume !(0 == ~cond); {35881#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:18,870 INFO L290 TraceCheckUtils]: 45: Hoare triple {35881#(<= ~counter~0 2)} assume true; {35881#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:18,871 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35881#(<= ~counter~0 2)} {35881#(<= ~counter~0 2)} #86#return; {35881#(<= ~counter~0 2)} is VALID [2022-04-08 06:33:18,871 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-08 06:33:18,872 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-08 06:33:18,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {35936#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {35936#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:18,873 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-08 06:33:18,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {35936#(<= ~counter~0 3)} ~cond := #in~cond; {35936#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:18,873 INFO L290 TraceCheckUtils]: 52: Hoare triple {35936#(<= ~counter~0 3)} assume !(0 == ~cond); {35936#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:18,873 INFO L290 TraceCheckUtils]: 53: Hoare triple {35936#(<= ~counter~0 3)} assume true; {35936#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:18,874 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {35936#(<= ~counter~0 3)} {35936#(<= ~counter~0 3)} #82#return; {35936#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:18,874 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-08 06:33:18,874 INFO L290 TraceCheckUtils]: 56: Hoare triple {35936#(<= ~counter~0 3)} ~cond := #in~cond; {35936#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:18,875 INFO L290 TraceCheckUtils]: 57: Hoare triple {35936#(<= ~counter~0 3)} assume !(0 == ~cond); {35936#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:18,875 INFO L290 TraceCheckUtils]: 58: Hoare triple {35936#(<= ~counter~0 3)} assume true; {35936#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:18,875 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35936#(<= ~counter~0 3)} {35936#(<= ~counter~0 3)} #84#return; {35936#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:18,876 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-08 06:33:18,876 INFO L290 TraceCheckUtils]: 61: Hoare triple {35936#(<= ~counter~0 3)} ~cond := #in~cond; {35936#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:18,876 INFO L290 TraceCheckUtils]: 62: Hoare triple {35936#(<= ~counter~0 3)} assume !(0 == ~cond); {35936#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:18,877 INFO L290 TraceCheckUtils]: 63: Hoare triple {35936#(<= ~counter~0 3)} assume true; {35936#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:18,877 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35936#(<= ~counter~0 3)} {35936#(<= ~counter~0 3)} #86#return; {35936#(<= ~counter~0 3)} is VALID [2022-04-08 06:33:18,877 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-08 06:33:18,878 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-08 06:33:18,878 INFO L290 TraceCheckUtils]: 67: Hoare triple {35991#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,879 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-08 06:33:18,879 INFO L290 TraceCheckUtils]: 69: Hoare triple {35991#(<= ~counter~0 4)} ~cond := #in~cond; {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,879 INFO L290 TraceCheckUtils]: 70: Hoare triple {35991#(<= ~counter~0 4)} assume !(0 == ~cond); {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {35991#(<= ~counter~0 4)} assume true; {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,880 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {35991#(<= ~counter~0 4)} {35991#(<= ~counter~0 4)} #82#return; {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,880 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-08 06:33:18,881 INFO L290 TraceCheckUtils]: 74: Hoare triple {35991#(<= ~counter~0 4)} ~cond := #in~cond; {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,881 INFO L290 TraceCheckUtils]: 75: Hoare triple {35991#(<= ~counter~0 4)} assume !(0 == ~cond); {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,881 INFO L290 TraceCheckUtils]: 76: Hoare triple {35991#(<= ~counter~0 4)} assume true; {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,882 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {35991#(<= ~counter~0 4)} {35991#(<= ~counter~0 4)} #84#return; {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,882 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-08 06:33:18,882 INFO L290 TraceCheckUtils]: 79: Hoare triple {35991#(<= ~counter~0 4)} ~cond := #in~cond; {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,892 INFO L290 TraceCheckUtils]: 80: Hoare triple {35991#(<= ~counter~0 4)} assume !(0 == ~cond); {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,893 INFO L290 TraceCheckUtils]: 81: Hoare triple {35991#(<= ~counter~0 4)} assume true; {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,893 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {35991#(<= ~counter~0 4)} {35991#(<= ~counter~0 4)} #86#return; {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,894 INFO L290 TraceCheckUtils]: 83: Hoare triple {35991#(<= ~counter~0 4)} assume !(~r~0 >= ~d~0); {35991#(<= ~counter~0 4)} is VALID [2022-04-08 06:33:18,895 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-08 06:33:18,895 INFO L290 TraceCheckUtils]: 85: Hoare triple {36046#(<= ~counter~0 5)} assume !!(#t~post7 < 50);havoc #t~post7; {36046#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:18,895 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-08 06:33:18,896 INFO L290 TraceCheckUtils]: 87: Hoare triple {36046#(<= ~counter~0 5)} ~cond := #in~cond; {36046#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:18,896 INFO L290 TraceCheckUtils]: 88: Hoare triple {36046#(<= ~counter~0 5)} assume !(0 == ~cond); {36046#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:18,896 INFO L290 TraceCheckUtils]: 89: Hoare triple {36046#(<= ~counter~0 5)} assume true; {36046#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:18,897 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {36046#(<= ~counter~0 5)} {36046#(<= ~counter~0 5)} #88#return; {36046#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:18,897 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-08 06:33:18,897 INFO L290 TraceCheckUtils]: 92: Hoare triple {36046#(<= ~counter~0 5)} ~cond := #in~cond; {36046#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:18,898 INFO L290 TraceCheckUtils]: 93: Hoare triple {36046#(<= ~counter~0 5)} assume !(0 == ~cond); {36046#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:18,898 INFO L290 TraceCheckUtils]: 94: Hoare triple {36046#(<= ~counter~0 5)} assume true; {36046#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:18,898 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {36046#(<= ~counter~0 5)} {36046#(<= ~counter~0 5)} #90#return; {36046#(<= ~counter~0 5)} is VALID [2022-04-08 06:33:18,899 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-08 06:33:18,899 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-08 06:33:18,900 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-08 06:33:18,900 INFO L290 TraceCheckUtils]: 99: Hoare triple {36089#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {36089#(<= ~counter~0 6)} is VALID [2022-04-08 06:33:18,900 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-08 06:33:18,901 INFO L290 TraceCheckUtils]: 101: Hoare triple {36089#(<= ~counter~0 6)} ~cond := #in~cond; {36089#(<= ~counter~0 6)} is VALID [2022-04-08 06:33:18,901 INFO L290 TraceCheckUtils]: 102: Hoare triple {36089#(<= ~counter~0 6)} assume !(0 == ~cond); {36089#(<= ~counter~0 6)} is VALID [2022-04-08 06:33:18,901 INFO L290 TraceCheckUtils]: 103: Hoare triple {36089#(<= ~counter~0 6)} assume true; {36089#(<= ~counter~0 6)} is VALID [2022-04-08 06:33:18,902 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {36089#(<= ~counter~0 6)} {36089#(<= ~counter~0 6)} #88#return; {36089#(<= ~counter~0 6)} is VALID [2022-04-08 06:33:18,902 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-08 06:33:18,903 INFO L290 TraceCheckUtils]: 106: Hoare triple {36089#(<= ~counter~0 6)} ~cond := #in~cond; {36089#(<= ~counter~0 6)} is VALID [2022-04-08 06:33:18,903 INFO L290 TraceCheckUtils]: 107: Hoare triple {36089#(<= ~counter~0 6)} assume !(0 == ~cond); {36089#(<= ~counter~0 6)} is VALID [2022-04-08 06:33:18,903 INFO L290 TraceCheckUtils]: 108: Hoare triple {36089#(<= ~counter~0 6)} assume true; {36089#(<= ~counter~0 6)} is VALID [2022-04-08 06:33:18,904 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {36089#(<= ~counter~0 6)} {36089#(<= ~counter~0 6)} #90#return; {36089#(<= ~counter~0 6)} is VALID [2022-04-08 06:33:18,904 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-08 06:33:18,904 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-08 06:33:18,905 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-08 06:33:18,905 INFO L290 TraceCheckUtils]: 113: Hoare triple {36132#(<= |main_#t~post7| 6)} assume !(#t~post7 < 50);havoc #t~post7; {35785#false} is VALID [2022-04-08 06:33:18,905 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-08 06:33:18,905 INFO L290 TraceCheckUtils]: 115: Hoare triple {35785#false} ~cond := #in~cond; {35785#false} is VALID [2022-04-08 06:33:18,905 INFO L290 TraceCheckUtils]: 116: Hoare triple {35785#false} assume 0 == ~cond; {35785#false} is VALID [2022-04-08 06:33:18,905 INFO L290 TraceCheckUtils]: 117: Hoare triple {35785#false} assume !false; {35785#false} is VALID [2022-04-08 06:33:18,906 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-08 06:33:18,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:33:19,385 INFO L290 TraceCheckUtils]: 117: Hoare triple {35785#false} assume !false; {35785#false} is VALID [2022-04-08 06:33:19,386 INFO L290 TraceCheckUtils]: 116: Hoare triple {35785#false} assume 0 == ~cond; {35785#false} is VALID [2022-04-08 06:33:19,386 INFO L290 TraceCheckUtils]: 115: Hoare triple {35785#false} ~cond := #in~cond; {35785#false} is VALID [2022-04-08 06:33:19,386 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-08 06:33:19,386 INFO L290 TraceCheckUtils]: 113: Hoare triple {36160#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {35785#false} is VALID [2022-04-08 06:33:19,386 INFO L290 TraceCheckUtils]: 112: Hoare triple {36164#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36160#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:33:19,387 INFO L290 TraceCheckUtils]: 111: Hoare triple {36164#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {36164#(< ~counter~0 50)} is VALID [2022-04-08 06:33:19,387 INFO L290 TraceCheckUtils]: 110: Hoare triple {36164#(< ~counter~0 50)} 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 50)} is VALID [2022-04-08 06:33:19,388 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {35784#true} {36164#(< ~counter~0 50)} #90#return; {36164#(< ~counter~0 50)} is VALID [2022-04-08 06:33:19,388 INFO L290 TraceCheckUtils]: 108: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,388 INFO L290 TraceCheckUtils]: 107: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,388 INFO L290 TraceCheckUtils]: 106: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,388 INFO L272 TraceCheckUtils]: 105: Hoare triple {36164#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,388 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35784#true} {36164#(< ~counter~0 50)} #88#return; {36164#(< ~counter~0 50)} is VALID [2022-04-08 06:33:19,388 INFO L290 TraceCheckUtils]: 103: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,388 INFO L290 TraceCheckUtils]: 102: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,389 INFO L290 TraceCheckUtils]: 101: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,389 INFO L272 TraceCheckUtils]: 100: Hoare triple {36164#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,389 INFO L290 TraceCheckUtils]: 99: Hoare triple {36164#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {36164#(< ~counter~0 50)} is VALID [2022-04-08 06:33:19,390 INFO L290 TraceCheckUtils]: 98: Hoare triple {36207#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36164#(< ~counter~0 50)} is VALID [2022-04-08 06:33:19,390 INFO L290 TraceCheckUtils]: 97: Hoare triple {36207#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {36207#(< ~counter~0 49)} is VALID [2022-04-08 06:33:19,390 INFO L290 TraceCheckUtils]: 96: Hoare triple {36207#(< ~counter~0 49)} 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 49)} is VALID [2022-04-08 06:33:19,391 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {35784#true} {36207#(< ~counter~0 49)} #90#return; {36207#(< ~counter~0 49)} is VALID [2022-04-08 06:33:19,391 INFO L290 TraceCheckUtils]: 94: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,391 INFO L290 TraceCheckUtils]: 93: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,391 INFO L290 TraceCheckUtils]: 92: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,391 INFO L272 TraceCheckUtils]: 91: Hoare triple {36207#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,392 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {35784#true} {36207#(< ~counter~0 49)} #88#return; {36207#(< ~counter~0 49)} is VALID [2022-04-08 06:33:19,392 INFO L290 TraceCheckUtils]: 89: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,392 INFO L290 TraceCheckUtils]: 88: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,392 INFO L290 TraceCheckUtils]: 87: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,392 INFO L272 TraceCheckUtils]: 86: Hoare triple {36207#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,392 INFO L290 TraceCheckUtils]: 85: Hoare triple {36207#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {36207#(< ~counter~0 49)} is VALID [2022-04-08 06:33:19,393 INFO L290 TraceCheckUtils]: 84: Hoare triple {36250#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36207#(< ~counter~0 49)} is VALID [2022-04-08 06:33:19,393 INFO L290 TraceCheckUtils]: 83: Hoare triple {36250#(< ~counter~0 48)} assume !(~r~0 >= ~d~0); {36250#(< ~counter~0 48)} is VALID [2022-04-08 06:33:19,394 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {35784#true} {36250#(< ~counter~0 48)} #86#return; {36250#(< ~counter~0 48)} is VALID [2022-04-08 06:33:19,394 INFO L290 TraceCheckUtils]: 81: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,394 INFO L290 TraceCheckUtils]: 80: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,394 INFO L290 TraceCheckUtils]: 79: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,394 INFO L272 TraceCheckUtils]: 78: Hoare triple {36250#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,394 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {35784#true} {36250#(< ~counter~0 48)} #84#return; {36250#(< ~counter~0 48)} is VALID [2022-04-08 06:33:19,394 INFO L290 TraceCheckUtils]: 76: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,394 INFO L290 TraceCheckUtils]: 75: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,394 INFO L290 TraceCheckUtils]: 74: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,395 INFO L272 TraceCheckUtils]: 73: Hoare triple {36250#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,395 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {35784#true} {36250#(< ~counter~0 48)} #82#return; {36250#(< ~counter~0 48)} is VALID [2022-04-08 06:33:19,395 INFO L290 TraceCheckUtils]: 71: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,395 INFO L290 TraceCheckUtils]: 70: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,395 INFO L290 TraceCheckUtils]: 69: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,395 INFO L272 TraceCheckUtils]: 68: Hoare triple {36250#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,395 INFO L290 TraceCheckUtils]: 67: Hoare triple {36250#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {36250#(< ~counter~0 48)} is VALID [2022-04-08 06:33:19,396 INFO L290 TraceCheckUtils]: 66: Hoare triple {36305#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36250#(< ~counter~0 48)} is VALID [2022-04-08 06:33:19,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {36305#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36305#(< ~counter~0 47)} is VALID [2022-04-08 06:33:19,397 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35784#true} {36305#(< ~counter~0 47)} #86#return; {36305#(< ~counter~0 47)} is VALID [2022-04-08 06:33:19,397 INFO L290 TraceCheckUtils]: 63: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,397 INFO L290 TraceCheckUtils]: 62: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,397 INFO L290 TraceCheckUtils]: 61: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,397 INFO L272 TraceCheckUtils]: 60: Hoare triple {36305#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,397 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35784#true} {36305#(< ~counter~0 47)} #84#return; {36305#(< ~counter~0 47)} is VALID [2022-04-08 06:33:19,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,398 INFO L290 TraceCheckUtils]: 56: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,398 INFO L272 TraceCheckUtils]: 55: Hoare triple {36305#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,398 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {35784#true} {36305#(< ~counter~0 47)} #82#return; {36305#(< ~counter~0 47)} is VALID [2022-04-08 06:33:19,398 INFO L290 TraceCheckUtils]: 53: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,398 INFO L272 TraceCheckUtils]: 50: Hoare triple {36305#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,399 INFO L290 TraceCheckUtils]: 49: Hoare triple {36305#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {36305#(< ~counter~0 47)} is VALID [2022-04-08 06:33:19,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {36360#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36305#(< ~counter~0 47)} is VALID [2022-04-08 06:33:19,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {36360#(< ~counter~0 46)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36360#(< ~counter~0 46)} is VALID [2022-04-08 06:33:19,400 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35784#true} {36360#(< ~counter~0 46)} #86#return; {36360#(< ~counter~0 46)} is VALID [2022-04-08 06:33:19,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,400 INFO L272 TraceCheckUtils]: 42: Hoare triple {36360#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,401 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35784#true} {36360#(< ~counter~0 46)} #84#return; {36360#(< ~counter~0 46)} is VALID [2022-04-08 06:33:19,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,401 INFO L272 TraceCheckUtils]: 37: Hoare triple {36360#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,401 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35784#true} {36360#(< ~counter~0 46)} #82#return; {36360#(< ~counter~0 46)} is VALID [2022-04-08 06:33:19,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,402 INFO L272 TraceCheckUtils]: 32: Hoare triple {36360#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {36360#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {36360#(< ~counter~0 46)} is VALID [2022-04-08 06:33:19,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {36415#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36360#(< ~counter~0 46)} is VALID [2022-04-08 06:33:19,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {36415#(< ~counter~0 45)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36415#(< ~counter~0 45)} is VALID [2022-04-08 06:33:19,403 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {35784#true} {36415#(< ~counter~0 45)} #86#return; {36415#(< ~counter~0 45)} is VALID [2022-04-08 06:33:19,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,404 INFO L272 TraceCheckUtils]: 24: Hoare triple {36415#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,404 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {35784#true} {36415#(< ~counter~0 45)} #84#return; {36415#(< ~counter~0 45)} is VALID [2022-04-08 06:33:19,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,404 INFO L272 TraceCheckUtils]: 19: Hoare triple {36415#(< ~counter~0 45)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,405 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {35784#true} {36415#(< ~counter~0 45)} #82#return; {36415#(< ~counter~0 45)} is VALID [2022-04-08 06:33:19,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,405 INFO L272 TraceCheckUtils]: 14: Hoare triple {36415#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {36415#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {36415#(< ~counter~0 45)} is VALID [2022-04-08 06:33:19,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {36470#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36415#(< ~counter~0 45)} is VALID [2022-04-08 06:33:19,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {36470#(< ~counter~0 44)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {36470#(< ~counter~0 44)} is VALID [2022-04-08 06:33:19,406 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35784#true} {36470#(< ~counter~0 44)} #80#return; {36470#(< ~counter~0 44)} is VALID [2022-04-08 06:33:19,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-08 06:33:19,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-08 06:33:19,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-08 06:33:19,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {36470#(< ~counter~0 44)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {35784#true} is VALID [2022-04-08 06:33:19,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {36470#(< ~counter~0 44)} 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 44)} is VALID [2022-04-08 06:33:19,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {36470#(< ~counter~0 44)} call #t~ret8 := main(); {36470#(< ~counter~0 44)} is VALID [2022-04-08 06:33:19,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36470#(< ~counter~0 44)} {35784#true} #96#return; {36470#(< ~counter~0 44)} is VALID [2022-04-08 06:33:19,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {36470#(< ~counter~0 44)} assume true; {36470#(< ~counter~0 44)} is VALID [2022-04-08 06:33:19,408 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 44)} is VALID [2022-04-08 06:33:19,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {35784#true} call ULTIMATE.init(); {35784#true} is VALID [2022-04-08 06:33:19,409 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-08 06:33:19,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:33:19,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788282704] [2022-04-08 06:33:19,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:33:19,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172938388] [2022-04-08 06:33:19,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172938388] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:33:19,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:33:19,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 06:33:19,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:33:19,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1579513161] [2022-04-08 06:33:19,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1579513161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:33:19,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:33:19,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 06:33:19,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646422043] [2022-04-08 06:33:19,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:33:19,410 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-08 06:33:19,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:33:19,410 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-08 06:33:19,503 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-08 06:33:19,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 06:33:19,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:33:19,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 06:33:19,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 06:33:19,504 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-08 06:33:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:33:20,489 INFO L93 Difference]: Finished difference Result 272 states and 312 transitions. [2022-04-08 06:33:20,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 06:33:20,489 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-08 06:33:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:33:20,490 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-08 06:33:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2022-04-08 06:33:20,491 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-08 06:33:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2022-04-08 06:33:20,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 152 transitions. [2022-04-08 06:33:20,705 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-08 06:33:20,709 INFO L225 Difference]: With dead ends: 272 [2022-04-08 06:33:20,709 INFO L226 Difference]: Without dead ends: 257 [2022-04-08 06:33:20,710 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-08 06:33:20,710 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 50 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:33:20,710 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.3s Time] [2022-04-08 06:33:20,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-08 06:33:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2022-04-08 06:33:21,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:33:21,058 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-08 06:33:21,058 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-08 06:33:21,058 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-08 06:33:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:33:21,061 INFO L93 Difference]: Finished difference Result 257 states and 292 transitions. [2022-04-08 06:33:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 292 transitions. [2022-04-08 06:33:21,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:33:21,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:33:21,062 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-08 06:33:21,062 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-08 06:33:21,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:33:21,065 INFO L93 Difference]: Finished difference Result 257 states and 292 transitions. [2022-04-08 06:33:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 292 transitions. [2022-04-08 06:33:21,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:33:21,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:33:21,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:33:21,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:33:21,066 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-08 06:33:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 290 transitions. [2022-04-08 06:33:21,070 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 290 transitions. Word has length 118 [2022-04-08 06:33:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:33:21,070 INFO L478 AbstractCegarLoop]: Abstraction has 254 states and 290 transitions. [2022-04-08 06:33:21,070 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-08 06:33:21,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 254 states and 290 transitions. [2022-04-08 06:33:23,584 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-08 06:33:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 290 transitions. [2022-04-08 06:33:23,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 06:33:23,585 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:33:23,585 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-08 06:33:23,603 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-08 06:33:23,785 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-08 06:33:23,786 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:33:23,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:33:23,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1564262477, now seen corresponding path program 17 times [2022-04-08 06:33:23,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:33:23,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [379153117] [2022-04-08 06:33:28,011 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:33:28,011 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:33:28,011 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:33:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1564262477, now seen corresponding path program 18 times [2022-04-08 06:33:28,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:33:28,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551620182] [2022-04-08 06:33:28,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:33:28,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:33:28,021 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:33:28,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358363992] [2022-04-08 06:33:28,021 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:33:28,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:33:28,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:33:28,022 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-08 06:33:28,023 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-08 06:33:28,085 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 06:33:28,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:33:28,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 06:33:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:33:28,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:33:30,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {38079#true} call ULTIMATE.init(); {38079#true} is VALID [2022-04-08 06:33:30,864 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-08 06:33:30,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38079#true} {38079#true} #96#return; {38079#true} is VALID [2022-04-08 06:33:30,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {38079#true} call #t~ret8 := main(); {38079#true} is VALID [2022-04-08 06:33:30,865 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-08 06:33:30,865 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-08 06:33:30,865 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-08 06:33:30,865 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-08 06:33:30,865 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-08 06:33:30,866 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-08 06:33:30,866 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-08 06:33:30,867 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-08 06:33:30,867 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 < 50);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-08 06:33:30,867 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-08 06:33:30,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,868 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-08 06:33:30,868 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-08 06:33:30,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,869 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-08 06:33:30,869 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-08 06:33:30,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,869 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-08 06:33:30,871 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-08 06:33:30,872 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-08 06:33:30,872 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 < 50);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-08 06:33:30,872 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-08 06:33:30,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,873 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-08 06:33:30,873 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-08 06:33:30,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,874 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-08 06:33:30,874 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-08 06:33:30,874 INFO L290 TraceCheckUtils]: 43: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,874 INFO L290 TraceCheckUtils]: 45: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,875 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-08 06:33:30,877 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-08 06:33:30,878 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-08 06:33:30,878 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 < 50);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-08 06:33:30,879 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-08 06:33:30,879 INFO L290 TraceCheckUtils]: 51: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,879 INFO L290 TraceCheckUtils]: 53: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,879 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-08 06:33:30,879 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-08 06:33:30,879 INFO L290 TraceCheckUtils]: 56: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,880 INFO L290 TraceCheckUtils]: 57: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,880 INFO L290 TraceCheckUtils]: 58: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,880 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-08 06:33:30,880 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-08 06:33:30,880 INFO L290 TraceCheckUtils]: 61: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,880 INFO L290 TraceCheckUtils]: 62: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,880 INFO L290 TraceCheckUtils]: 63: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,881 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-08 06:33:30,883 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-08 06:33:30,883 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-08 06:33:30,884 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 < 50);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-08 06:33:30,884 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-08 06:33:30,884 INFO L290 TraceCheckUtils]: 69: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,884 INFO L290 TraceCheckUtils]: 70: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,884 INFO L290 TraceCheckUtils]: 71: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,885 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-08 06:33:30,885 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-08 06:33:30,885 INFO L290 TraceCheckUtils]: 74: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,885 INFO L290 TraceCheckUtils]: 75: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,885 INFO L290 TraceCheckUtils]: 76: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,885 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-08 06:33:30,885 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-08 06:33:30,886 INFO L290 TraceCheckUtils]: 79: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,886 INFO L290 TraceCheckUtils]: 80: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,886 INFO L290 TraceCheckUtils]: 81: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,886 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-08 06:33:30,887 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-08 06:33:30,887 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-08 06:33:30,887 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 < 50);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-08 06:33:30,887 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-08 06:33:30,888 INFO L290 TraceCheckUtils]: 87: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,888 INFO L290 TraceCheckUtils]: 88: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,888 INFO L290 TraceCheckUtils]: 89: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,888 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-08 06:33:30,888 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-08 06:33:30,888 INFO L290 TraceCheckUtils]: 92: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,888 INFO L290 TraceCheckUtils]: 93: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,888 INFO L290 TraceCheckUtils]: 94: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,889 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-08 06:33:30,891 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-08 06:33:30,894 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-08 06:33:30,894 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-08 06:33:30,895 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 < 50);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-08 06:33:30,895 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-08 06:33:30,895 INFO L290 TraceCheckUtils]: 101: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,895 INFO L290 TraceCheckUtils]: 102: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,895 INFO L290 TraceCheckUtils]: 103: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,896 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-08 06:33:30,896 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-08 06:33:30,896 INFO L290 TraceCheckUtils]: 106: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:33:30,896 INFO L290 TraceCheckUtils]: 107: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:33:30,896 INFO L290 TraceCheckUtils]: 108: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:33:30,896 INFO L284 TraceCheckUtils]: 109: 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))} #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-08 06:33:30,898 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); {38422#(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-08 06:33:30,899 INFO L290 TraceCheckUtils]: 111: Hoare triple {38422#(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; {38426#(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-08 06:33:30,900 INFO L290 TraceCheckUtils]: 112: Hoare triple {38426#(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; {38426#(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-08 06:33:30,900 INFO L290 TraceCheckUtils]: 113: Hoare triple {38426#(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 < 50);havoc #t~post7; {38426#(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-08 06:33:30,901 INFO L272 TraceCheckUtils]: 114: Hoare triple {38426#(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)); {38436#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:33:30,901 INFO L290 TraceCheckUtils]: 115: Hoare triple {38436#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38440#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:33:30,902 INFO L290 TraceCheckUtils]: 116: Hoare triple {38440#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {38080#false} is VALID [2022-04-08 06:33:30,902 INFO L290 TraceCheckUtils]: 117: Hoare triple {38080#false} assume !false; {38080#false} is VALID [2022-04-08 06:33:30,902 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 32 proven. 48 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 06:33:30,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:34:23,014 INFO L290 TraceCheckUtils]: 117: Hoare triple {38080#false} assume !false; {38080#false} is VALID [2022-04-08 06:34:23,015 INFO L290 TraceCheckUtils]: 116: Hoare triple {38440#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {38080#false} is VALID [2022-04-08 06:34:23,015 INFO L290 TraceCheckUtils]: 115: Hoare triple {38436#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38440#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:34:23,016 INFO L272 TraceCheckUtils]: 114: Hoare triple {38456#(= (+ 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)); {38436#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:34:23,016 INFO L290 TraceCheckUtils]: 113: Hoare triple {38456#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !!(#t~post7 < 50);havoc #t~post7; {38456#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:34:23,016 INFO L290 TraceCheckUtils]: 112: Hoare triple {38456#(= (+ 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; {38456#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:34:23,020 INFO L290 TraceCheckUtils]: 111: Hoare triple {38466#(= (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; {38456#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:34:23,040 INFO L290 TraceCheckUtils]: 110: Hoare triple {38470#(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); {38466#(= (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-08 06:34:23,041 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {38079#true} {38470#(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; {38470#(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-08 06:34:23,041 INFO L290 TraceCheckUtils]: 108: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,041 INFO L290 TraceCheckUtils]: 107: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,041 INFO L290 TraceCheckUtils]: 106: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,041 INFO L272 TraceCheckUtils]: 105: Hoare triple {38470#(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)); {38079#true} is VALID [2022-04-08 06:34:23,041 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {38079#true} {38470#(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; {38470#(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-08 06:34:23,041 INFO L290 TraceCheckUtils]: 103: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,042 INFO L290 TraceCheckUtils]: 102: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,042 INFO L290 TraceCheckUtils]: 101: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,042 INFO L272 TraceCheckUtils]: 100: Hoare triple {38470#(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)); {38079#true} is VALID [2022-04-08 06:34:23,043 INFO L290 TraceCheckUtils]: 99: Hoare triple {38470#(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 < 50);havoc #t~post7; {38470#(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-08 06:34:23,044 INFO L290 TraceCheckUtils]: 98: Hoare triple {38470#(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; {38470#(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-08 06:34:23,066 INFO L290 TraceCheckUtils]: 97: Hoare triple {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~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; {38470#(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-08 06:34:23,337 INFO L290 TraceCheckUtils]: 96: Hoare triple {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~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); {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-08 06:34:23,338 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {38079#true} {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} #90#return; {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} is VALID [2022-04-08 06:34:23,338 INFO L290 TraceCheckUtils]: 94: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,338 INFO L290 TraceCheckUtils]: 93: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,338 INFO L290 TraceCheckUtils]: 92: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,338 INFO L272 TraceCheckUtils]: 91: Hoare triple {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {38079#true} is VALID [2022-04-08 06:34:23,339 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {38079#true} {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} #88#return; {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} is VALID [2022-04-08 06:34:23,339 INFO L290 TraceCheckUtils]: 89: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,339 INFO L290 TraceCheckUtils]: 88: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,339 INFO L290 TraceCheckUtils]: 87: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,340 INFO L272 TraceCheckUtils]: 86: Hoare triple {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 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-08 06:34:23,344 INFO L290 TraceCheckUtils]: 85: Hoare triple {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} assume !!(#t~post7 < 50);havoc #t~post7; {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} is VALID [2022-04-08 06:34:23,348 INFO L290 TraceCheckUtils]: 84: Hoare triple {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} is VALID [2022-04-08 06:34:23,353 INFO L290 TraceCheckUtils]: 83: Hoare triple {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} assume !(~r~0 >= ~d~0); {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} is VALID [2022-04-08 06:34:23,354 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {38079#true} {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} #86#return; {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} is VALID [2022-04-08 06:34:23,354 INFO L290 TraceCheckUtils]: 81: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,354 INFO L290 TraceCheckUtils]: 80: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,354 INFO L290 TraceCheckUtils]: 79: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,354 INFO L272 TraceCheckUtils]: 78: Hoare triple {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {38079#true} is VALID [2022-04-08 06:34:23,355 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {38079#true} {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} #84#return; {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} is VALID [2022-04-08 06:34:23,355 INFO L290 TraceCheckUtils]: 76: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,355 INFO L290 TraceCheckUtils]: 75: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,355 INFO L290 TraceCheckUtils]: 74: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,355 INFO L272 TraceCheckUtils]: 73: Hoare triple {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {38079#true} is VALID [2022-04-08 06:34:23,356 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {38079#true} {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} #82#return; {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} is VALID [2022-04-08 06:34:23,356 INFO L290 TraceCheckUtils]: 71: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,356 INFO L290 TraceCheckUtils]: 70: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,356 INFO L290 TraceCheckUtils]: 69: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,356 INFO L272 TraceCheckUtils]: 68: Hoare triple {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38079#true} is VALID [2022-04-08 06:34:23,360 INFO L290 TraceCheckUtils]: 67: Hoare triple {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} assume !!(#t~post6 < 50);havoc #t~post6; {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} is VALID [2022-04-08 06:34:23,365 INFO L290 TraceCheckUtils]: 66: Hoare triple {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} is VALID [2022-04-08 06:34:23,497 INFO L290 TraceCheckUtils]: 65: Hoare triple {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38514#(and (or (and (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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))))) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 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)))) (not (< (div main_~d~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))) (= (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)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (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)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= (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)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (not (< (div main_~d~0 2) 0)) (= (+ (* (+ 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_~d~0 2) 2) 0)) (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)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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 (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~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) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (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)) (- 2) 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 (= (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)))) (not (= 0 (mod (+ (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)) (and (or (= (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)))) (or (= (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))))} is VALID [2022-04-08 06:34:23,498 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {38079#true} {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} #86#return; {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-08 06:34:23,498 INFO L290 TraceCheckUtils]: 63: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,499 INFO L272 TraceCheckUtils]: 60: Hoare triple {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {38079#true} is VALID [2022-04-08 06:34:23,499 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {38079#true} {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} #84#return; {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-08 06:34:23,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,499 INFO L290 TraceCheckUtils]: 57: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,499 INFO L290 TraceCheckUtils]: 56: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,500 INFO L272 TraceCheckUtils]: 55: Hoare triple {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {38079#true} is VALID [2022-04-08 06:34:23,500 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {38079#true} {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} #82#return; {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-08 06:34:23,500 INFO L290 TraceCheckUtils]: 53: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,500 INFO L290 TraceCheckUtils]: 52: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,500 INFO L272 TraceCheckUtils]: 50: Hoare triple {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38079#true} is VALID [2022-04-08 06:34:23,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} assume !!(#t~post6 < 50);havoc #t~post6; {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-08 06:34:23,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-08 06:34:23,510 INFO L290 TraceCheckUtils]: 47: Hoare triple {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38510#(and (or (not (< main_~p~0 0)) (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)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (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)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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 (< main_~d~0 0)) (= (mod main_~d~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_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-08 06:34:23,510 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {38079#true} {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} #86#return; {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:23,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,511 INFO L272 TraceCheckUtils]: 42: Hoare triple {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {38079#true} is VALID [2022-04-08 06:34:23,511 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {38079#true} {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} #84#return; {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:23,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,511 INFO L272 TraceCheckUtils]: 37: Hoare triple {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {38079#true} is VALID [2022-04-08 06:34:23,512 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {38079#true} {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} #82#return; {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:23,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,512 INFO L272 TraceCheckUtils]: 32: Hoare triple {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38079#true} is VALID [2022-04-08 06:34:23,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} assume !!(#t~post6 < 50);havoc #t~post6; {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:23,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:23,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38662#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 3)) (+ main_~r~0 (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~q~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:23,516 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {38079#true} {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} #86#return; {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:23,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,516 INFO L272 TraceCheckUtils]: 24: Hoare triple {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {38079#true} is VALID [2022-04-08 06:34:23,516 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {38079#true} {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} #84#return; {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:23,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,517 INFO L272 TraceCheckUtils]: 19: Hoare triple {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {38079#true} is VALID [2022-04-08 06:34:23,517 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {38079#true} {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} #82#return; {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:23,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,518 INFO L272 TraceCheckUtils]: 14: Hoare triple {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38079#true} is VALID [2022-04-08 06:34:23,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} assume !!(#t~post6 < 50);havoc #t~post6; {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:23,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:23,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {38079#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {38717#(= (+ (mod main_~A~0 4294967296) (* main_~d~0 6)) (+ (* (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 3) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:23,522 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38079#true} {38079#true} #80#return; {38079#true} is VALID [2022-04-08 06:34:23,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-08 06:34:23,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-08 06:34:23,522 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-08 06:34:23,522 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-08 06:34:23,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {38079#true} call #t~ret8 := main(); {38079#true} is VALID [2022-04-08 06:34:23,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38079#true} {38079#true} #96#return; {38079#true} is VALID [2022-04-08 06:34:23,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-08 06:34:23,522 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-08 06:34:23,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {38079#true} call ULTIMATE.init(); {38079#true} is VALID [2022-04-08 06:34:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 32 proven. 48 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 06:34:23,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:34:23,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551620182] [2022-04-08 06:34:23,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:34:23,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358363992] [2022-04-08 06:34:23,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358363992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:34:23,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:34:23,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2022-04-08 06:34:23,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:34:23,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [379153117] [2022-04-08 06:34:23,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [379153117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:34:23,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:34:23,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 06:34:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137542015] [2022-04-08 06:34:23,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:34:23,525 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 118 [2022-04-08 06:34:23,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:34:23,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 06:34:23,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:34:23,672 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 06:34:23,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:34:23,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 06:34:23,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-04-08 06:34:23,672 INFO L87 Difference]: Start difference. First operand 254 states and 290 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 06:34:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:34:27,620 INFO L93 Difference]: Finished difference Result 274 states and 310 transitions. [2022-04-08 06:34:27,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 06:34:27,621 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 118 [2022-04-08 06:34:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:34:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 06:34:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 120 transitions. [2022-04-08 06:34:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 06:34:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 120 transitions. [2022-04-08 06:34:27,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 120 transitions. [2022-04-08 06:34:27,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:34:27,831 INFO L225 Difference]: With dead ends: 274 [2022-04-08 06:34:27,832 INFO L226 Difference]: Without dead ends: 272 [2022-04-08 06:34:27,832 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 213 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2022-04-08 06:34:27,832 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 40 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 06:34:27,832 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 383 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 06:34:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-04-08 06:34:28,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2022-04-08 06:34:28,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:34:28,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 272 states. Second operand has 269 states, 179 states have (on average 1.1284916201117319) internal successors, (202), 186 states have internal predecessors, (202), 53 states have call successors, (53), 38 states have call predecessors, (53), 36 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 06:34:28,139 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand has 269 states, 179 states have (on average 1.1284916201117319) internal successors, (202), 186 states have internal predecessors, (202), 53 states have call successors, (53), 38 states have call predecessors, (53), 36 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 06:34:28,139 INFO L87 Difference]: Start difference. First operand 272 states. Second operand has 269 states, 179 states have (on average 1.1284916201117319) internal successors, (202), 186 states have internal predecessors, (202), 53 states have call successors, (53), 38 states have call predecessors, (53), 36 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 06:34:28,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:34:28,143 INFO L93 Difference]: Finished difference Result 272 states and 308 transitions. [2022-04-08 06:34:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 308 transitions. [2022-04-08 06:34:28,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:34:28,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:34:28,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 269 states, 179 states have (on average 1.1284916201117319) internal successors, (202), 186 states have internal predecessors, (202), 53 states have call successors, (53), 38 states have call predecessors, (53), 36 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) Second operand 272 states. [2022-04-08 06:34:28,144 INFO L87 Difference]: Start difference. First operand has 269 states, 179 states have (on average 1.1284916201117319) internal successors, (202), 186 states have internal predecessors, (202), 53 states have call successors, (53), 38 states have call predecessors, (53), 36 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) Second operand 272 states. [2022-04-08 06:34:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:34:28,148 INFO L93 Difference]: Finished difference Result 272 states and 308 transitions. [2022-04-08 06:34:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 308 transitions. [2022-04-08 06:34:28,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:34:28,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:34:28,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:34:28,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:34:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 179 states have (on average 1.1284916201117319) internal successors, (202), 186 states have internal predecessors, (202), 53 states have call successors, (53), 38 states have call predecessors, (53), 36 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 06:34:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 304 transitions. [2022-04-08 06:34:28,173 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 304 transitions. Word has length 118 [2022-04-08 06:34:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:34:28,173 INFO L478 AbstractCegarLoop]: Abstraction has 269 states and 304 transitions. [2022-04-08 06:34:28,173 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 06:34:28,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 269 states and 304 transitions. [2022-04-08 06:34:30,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 304 edges. 303 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:34:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 304 transitions. [2022-04-08 06:34:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 06:34:30,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:34:30,720 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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-08 06:34:30,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-08 06:34:30,921 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:34:30,921 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:34:30,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:34:30,921 INFO L85 PathProgramCache]: Analyzing trace with hash 152469059, now seen corresponding path program 19 times [2022-04-08 06:34:30,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:34:30,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2021617520] [2022-04-08 06:34:36,597 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:34:36,598 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:34:36,598 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:34:36,598 INFO L85 PathProgramCache]: Analyzing trace with hash 152469059, now seen corresponding path program 20 times [2022-04-08 06:34:36,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:34:36,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714671823] [2022-04-08 06:34:36,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:34:36,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:34:36,607 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:34:36,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304178122] [2022-04-08 06:34:36,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:34:36,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:34:36,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:34:36,609 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:34:36,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 06:34:36,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:34:36,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:34:36,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-08 06:34:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:34:36,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:34:42,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {40441#true} call ULTIMATE.init(); {40441#true} is VALID [2022-04-08 06:34:42,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {40441#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {40441#true} is VALID [2022-04-08 06:34:42,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40441#true} {40441#true} #96#return; {40441#true} is VALID [2022-04-08 06:34:42,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {40441#true} call #t~ret8 := main(); {40441#true} is VALID [2022-04-08 06:34:42,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {40441#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; {40441#true} is VALID [2022-04-08 06:34:42,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {40441#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40441#true} is VALID [2022-04-08 06:34:42,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {40441#true} ~cond := #in~cond; {40467#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:34:42,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {40467#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {40471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:34:42,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {40471#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {40471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:34:42,720 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40471#(not (= |assume_abort_if_not_#in~cond| 0))} {40441#true} #80#return; {40478#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-08 06:34:42,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {40478#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {40482#(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-08 06:34:42,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {40482#(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; {40482#(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-08 06:34:42,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {40482#(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 < 50);havoc #t~post6; {40482#(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-08 06:34:42,721 INFO L272 TraceCheckUtils]: 14: Hoare triple {40482#(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)); {40441#true} is VALID [2022-04-08 06:34:42,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,722 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {40441#true} {40482#(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; {40482#(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-08 06:34:42,722 INFO L272 TraceCheckUtils]: 19: Hoare triple {40482#(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)); {40441#true} is VALID [2022-04-08 06:34:42,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,723 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40441#true} {40482#(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; {40482#(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-08 06:34:42,723 INFO L272 TraceCheckUtils]: 24: Hoare triple {40482#(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)); {40441#true} is VALID [2022-04-08 06:34:42,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,723 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {40441#true} {40482#(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; {40482#(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-08 06:34:42,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {40482#(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; {40537#(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-08 06:34:42,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {40537#(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; {40537#(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-08 06:34:42,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {40537#(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 < 50);havoc #t~post6; {40537#(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-08 06:34:42,726 INFO L272 TraceCheckUtils]: 32: Hoare triple {40537#(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)); {40441#true} is VALID [2022-04-08 06:34:42,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,727 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {40441#true} {40537#(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; {40537#(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-08 06:34:42,727 INFO L272 TraceCheckUtils]: 37: Hoare triple {40537#(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)); {40441#true} is VALID [2022-04-08 06:34:42,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,728 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {40441#true} {40537#(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; {40537#(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-08 06:34:42,728 INFO L272 TraceCheckUtils]: 42: Hoare triple {40537#(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)); {40441#true} is VALID [2022-04-08 06:34:42,728 INFO L290 TraceCheckUtils]: 43: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,728 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {40441#true} {40537#(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; {40537#(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-08 06:34:42,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {40537#(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; {40592#(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-08 06:34:42,731 INFO L290 TraceCheckUtils]: 48: Hoare triple {40592#(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; {40592#(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-08 06:34:42,731 INFO L290 TraceCheckUtils]: 49: Hoare triple {40592#(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 < 50);havoc #t~post6; {40592#(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-08 06:34:42,732 INFO L272 TraceCheckUtils]: 50: Hoare triple {40592#(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)); {40441#true} is VALID [2022-04-08 06:34:42,732 INFO L290 TraceCheckUtils]: 51: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,733 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {40441#true} {40592#(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; {40592#(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-08 06:34:42,733 INFO L272 TraceCheckUtils]: 55: Hoare triple {40592#(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)); {40441#true} is VALID [2022-04-08 06:34:42,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,733 INFO L290 TraceCheckUtils]: 58: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,734 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {40441#true} {40592#(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; {40592#(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-08 06:34:42,734 INFO L272 TraceCheckUtils]: 60: Hoare triple {40592#(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)); {40441#true} is VALID [2022-04-08 06:34:42,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,734 INFO L290 TraceCheckUtils]: 62: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,740 INFO L290 TraceCheckUtils]: 63: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,743 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {40441#true} {40592#(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; {40592#(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-08 06:34:42,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {40592#(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; {40647#(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-08 06:34:42,746 INFO L290 TraceCheckUtils]: 66: Hoare triple {40647#(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; {40647#(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-08 06:34:42,746 INFO L290 TraceCheckUtils]: 67: Hoare triple {40647#(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 < 50);havoc #t~post6; {40647#(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-08 06:34:42,746 INFO L272 TraceCheckUtils]: 68: Hoare triple {40647#(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)); {40441#true} is VALID [2022-04-08 06:34:42,746 INFO L290 TraceCheckUtils]: 69: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,746 INFO L290 TraceCheckUtils]: 70: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,746 INFO L290 TraceCheckUtils]: 71: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,747 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {40441#true} {40647#(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; {40647#(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-08 06:34:42,747 INFO L272 TraceCheckUtils]: 73: Hoare triple {40647#(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)); {40441#true} is VALID [2022-04-08 06:34:42,747 INFO L290 TraceCheckUtils]: 74: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,747 INFO L290 TraceCheckUtils]: 75: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,747 INFO L290 TraceCheckUtils]: 76: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,747 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {40441#true} {40647#(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; {40647#(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-08 06:34:42,748 INFO L272 TraceCheckUtils]: 78: Hoare triple {40647#(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)); {40441#true} is VALID [2022-04-08 06:34:42,748 INFO L290 TraceCheckUtils]: 79: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,748 INFO L290 TraceCheckUtils]: 80: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,748 INFO L290 TraceCheckUtils]: 81: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,748 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {40441#true} {40647#(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; {40647#(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-08 06:34:42,750 INFO L290 TraceCheckUtils]: 83: Hoare triple {40647#(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);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-08 06:34:42,750 INFO L290 TraceCheckUtils]: 84: Hoare triple {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-08 06:34:42,751 INFO L290 TraceCheckUtils]: 85: Hoare triple {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-08 06:34:42,751 INFO L272 TraceCheckUtils]: 86: Hoare triple {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {40441#true} is VALID [2022-04-08 06:34:42,751 INFO L290 TraceCheckUtils]: 87: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,751 INFO L290 TraceCheckUtils]: 88: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,751 INFO L290 TraceCheckUtils]: 89: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,751 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {40441#true} {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} #82#return; {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-08 06:34:42,751 INFO L272 TraceCheckUtils]: 91: Hoare triple {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {40441#true} is VALID [2022-04-08 06:34:42,752 INFO L290 TraceCheckUtils]: 92: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,752 INFO L290 TraceCheckUtils]: 93: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,752 INFO L290 TraceCheckUtils]: 94: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,752 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40441#true} {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} #84#return; {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-08 06:34:42,752 INFO L272 TraceCheckUtils]: 96: Hoare triple {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {40441#true} is VALID [2022-04-08 06:34:42,752 INFO L290 TraceCheckUtils]: 97: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,752 INFO L290 TraceCheckUtils]: 98: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,752 INFO L290 TraceCheckUtils]: 99: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,753 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {40441#true} {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} #86#return; {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-08 06:34:42,753 INFO L290 TraceCheckUtils]: 101: Hoare triple {40702#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} assume !(~r~0 >= ~d~0); {40757#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (< main_~r~0 main_~d~0) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-08 06:34:42,754 INFO L290 TraceCheckUtils]: 102: Hoare triple {40757#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (< main_~r~0 main_~d~0) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40757#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (< main_~r~0 main_~d~0) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-08 06:34:42,754 INFO L290 TraceCheckUtils]: 103: Hoare triple {40757#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (< main_~r~0 main_~d~0) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {40757#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (< main_~r~0 main_~d~0) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-08 06:34:42,754 INFO L272 TraceCheckUtils]: 104: Hoare triple {40757#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (< main_~r~0 main_~d~0) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (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)); {40441#true} is VALID [2022-04-08 06:34:42,754 INFO L290 TraceCheckUtils]: 105: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,754 INFO L290 TraceCheckUtils]: 106: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,755 INFO L290 TraceCheckUtils]: 107: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,755 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {40441#true} {40757#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (< main_~r~0 main_~d~0) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} #88#return; {40757#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (< main_~r~0 main_~d~0) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-08 06:34:42,755 INFO L272 TraceCheckUtils]: 109: Hoare triple {40757#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (< main_~r~0 main_~d~0) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {40441#true} is VALID [2022-04-08 06:34:42,755 INFO L290 TraceCheckUtils]: 110: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:42,755 INFO L290 TraceCheckUtils]: 111: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:42,755 INFO L290 TraceCheckUtils]: 112: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:42,756 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {40441#true} {40757#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (< main_~r~0 main_~d~0) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} #90#return; {40757#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (< main_~r~0 main_~d~0) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-08 06:34:42,758 INFO L290 TraceCheckUtils]: 114: Hoare triple {40757#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 16) (< main_~r~0 main_~d~0) (= main_~q~0 0) (= (* 16 (mod main_~B~0 4294967296)) main_~d~0) (<= (* 8 (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); {40797#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (* 16 (mod main_~B~0 4294967296))) (= main_~p~0 8) (= main_~q~0 0) (= main_~d~0 (div (* 16 (mod main_~B~0 4294967296)) 2)) (<= (* 8 (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-08 06:34:42,760 INFO L290 TraceCheckUtils]: 115: Hoare triple {40797#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (* 16 (mod main_~B~0 4294967296))) (= main_~p~0 8) (= main_~q~0 0) (= main_~d~0 (div (* 16 (mod main_~B~0 4294967296)) 2)) (<= (* 8 (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; {40801#(and (<= (* 8 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)) (= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (div (* 16 (mod main_~B~0 4294967296)) 2)) (= main_~q~0 8) (< (mod main_~A~0 4294967296) (* 16 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:42,761 INFO L290 TraceCheckUtils]: 116: Hoare triple {40801#(and (<= (* 8 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)) (= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (div (* 16 (mod main_~B~0 4294967296)) 2)) (= main_~q~0 8) (< (mod main_~A~0 4294967296) (* 16 (mod main_~B~0 4294967296))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40801#(and (<= (* 8 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)) (= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (div (* 16 (mod main_~B~0 4294967296)) 2)) (= main_~q~0 8) (< (mod main_~A~0 4294967296) (* 16 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:42,761 INFO L290 TraceCheckUtils]: 117: Hoare triple {40801#(and (<= (* 8 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)) (= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (div (* 16 (mod main_~B~0 4294967296)) 2)) (= main_~q~0 8) (< (mod main_~A~0 4294967296) (* 16 (mod main_~B~0 4294967296))))} assume !!(#t~post7 < 50);havoc #t~post7; {40801#(and (<= (* 8 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)) (= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (div (* 16 (mod main_~B~0 4294967296)) 2)) (= main_~q~0 8) (< (mod main_~A~0 4294967296) (* 16 (mod main_~B~0 4294967296))))} is VALID [2022-04-08 06:34:42,762 INFO L272 TraceCheckUtils]: 118: Hoare triple {40801#(and (<= (* 8 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)) (= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (div (* 16 (mod main_~B~0 4294967296)) 2)) (= main_~q~0 8) (< (mod main_~A~0 4294967296) (* 16 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {40811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:34:42,762 INFO L290 TraceCheckUtils]: 119: Hoare triple {40811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:34:42,762 INFO L290 TraceCheckUtils]: 120: Hoare triple {40815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40442#false} is VALID [2022-04-08 06:34:42,763 INFO L290 TraceCheckUtils]: 121: Hoare triple {40442#false} assume !false; {40442#false} is VALID [2022-04-08 06:34:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 34 proven. 63 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-08 06:34:42,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:34:51,327 INFO L290 TraceCheckUtils]: 121: Hoare triple {40442#false} assume !false; {40442#false} is VALID [2022-04-08 06:34:51,328 INFO L290 TraceCheckUtils]: 120: Hoare triple {40815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40442#false} is VALID [2022-04-08 06:34:51,328 INFO L290 TraceCheckUtils]: 119: Hoare triple {40811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:34:51,328 INFO L272 TraceCheckUtils]: 118: Hoare triple {40831#(= (+ 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)); {40811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:34:51,329 INFO L290 TraceCheckUtils]: 117: Hoare triple {40831#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !!(#t~post7 < 50);havoc #t~post7; {40831#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:34:51,329 INFO L290 TraceCheckUtils]: 116: Hoare triple {40831#(= (+ 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; {40831#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:34:51,333 INFO L290 TraceCheckUtils]: 115: Hoare triple {40841#(= (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; {40831#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:34:51,349 INFO L290 TraceCheckUtils]: 114: Hoare triple {40845#(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); {40841#(= (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-08 06:34:51,350 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {40441#true} {40845#(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; {40845#(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-08 06:34:51,350 INFO L290 TraceCheckUtils]: 112: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,350 INFO L290 TraceCheckUtils]: 111: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,350 INFO L290 TraceCheckUtils]: 110: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,350 INFO L272 TraceCheckUtils]: 109: Hoare triple {40845#(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)); {40441#true} is VALID [2022-04-08 06:34:51,351 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {40441#true} {40845#(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; {40845#(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-08 06:34:51,351 INFO L290 TraceCheckUtils]: 107: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,351 INFO L290 TraceCheckUtils]: 106: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,351 INFO L290 TraceCheckUtils]: 105: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,351 INFO L272 TraceCheckUtils]: 104: Hoare triple {40845#(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)); {40441#true} is VALID [2022-04-08 06:34:51,353 INFO L290 TraceCheckUtils]: 103: Hoare triple {40845#(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 < 50);havoc #t~post7; {40845#(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-08 06:34:51,354 INFO L290 TraceCheckUtils]: 102: Hoare triple {40845#(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; {40845#(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-08 06:34:51,355 INFO L290 TraceCheckUtils]: 101: Hoare triple {40885#(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); {40845#(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-08 06:34:51,356 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {40441#true} {40885#(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; {40885#(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-08 06:34:51,356 INFO L290 TraceCheckUtils]: 99: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,356 INFO L290 TraceCheckUtils]: 98: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,356 INFO L290 TraceCheckUtils]: 97: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,356 INFO L272 TraceCheckUtils]: 96: Hoare triple {40885#(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)); {40441#true} is VALID [2022-04-08 06:34:51,357 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40441#true} {40885#(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; {40885#(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-08 06:34:51,357 INFO L290 TraceCheckUtils]: 94: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,357 INFO L290 TraceCheckUtils]: 93: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,357 INFO L290 TraceCheckUtils]: 92: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,357 INFO L272 TraceCheckUtils]: 91: Hoare triple {40885#(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)); {40441#true} is VALID [2022-04-08 06:34:51,357 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {40441#true} {40885#(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; {40885#(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-08 06:34:51,358 INFO L290 TraceCheckUtils]: 89: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,358 INFO L290 TraceCheckUtils]: 88: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,358 INFO L290 TraceCheckUtils]: 87: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,358 INFO L272 TraceCheckUtils]: 86: Hoare triple {40885#(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)); {40441#true} is VALID [2022-04-08 06:34:51,359 INFO L290 TraceCheckUtils]: 85: Hoare triple {40885#(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 < 50);havoc #t~post6; {40885#(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-08 06:34:51,360 INFO L290 TraceCheckUtils]: 84: Hoare triple {40885#(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; {40885#(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-08 06:34:51,366 INFO L290 TraceCheckUtils]: 83: Hoare triple {40940#(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; {40885#(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-08 06:34:51,366 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {40441#true} {40940#(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; {40940#(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-08 06:34:51,367 INFO L290 TraceCheckUtils]: 81: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,367 INFO L290 TraceCheckUtils]: 80: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,367 INFO L290 TraceCheckUtils]: 79: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,367 INFO L272 TraceCheckUtils]: 78: Hoare triple {40940#(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)); {40441#true} is VALID [2022-04-08 06:34:51,367 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {40441#true} {40940#(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; {40940#(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-08 06:34:51,367 INFO L290 TraceCheckUtils]: 76: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,368 INFO L290 TraceCheckUtils]: 75: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,368 INFO L290 TraceCheckUtils]: 74: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,368 INFO L272 TraceCheckUtils]: 73: Hoare triple {40940#(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)); {40441#true} is VALID [2022-04-08 06:34:51,368 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {40441#true} {40940#(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; {40940#(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-08 06:34:51,368 INFO L290 TraceCheckUtils]: 71: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,368 INFO L290 TraceCheckUtils]: 70: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,368 INFO L290 TraceCheckUtils]: 69: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,369 INFO L272 TraceCheckUtils]: 68: Hoare triple {40940#(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)); {40441#true} is VALID [2022-04-08 06:34:51,369 INFO L290 TraceCheckUtils]: 67: Hoare triple {40940#(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 < 50);havoc #t~post6; {40940#(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-08 06:34:51,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {40940#(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; {40940#(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-08 06:34:51,372 INFO L290 TraceCheckUtils]: 65: Hoare triple {40995#(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; {40940#(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-08 06:34:51,372 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {40441#true} {40995#(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; {40995#(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-08 06:34:51,372 INFO L290 TraceCheckUtils]: 63: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,373 INFO L290 TraceCheckUtils]: 61: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,373 INFO L272 TraceCheckUtils]: 60: Hoare triple {40995#(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)); {40441#true} is VALID [2022-04-08 06:34:51,373 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {40441#true} {40995#(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; {40995#(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-08 06:34:51,373 INFO L290 TraceCheckUtils]: 58: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,373 INFO L272 TraceCheckUtils]: 55: Hoare triple {40995#(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)); {40441#true} is VALID [2022-04-08 06:34:51,374 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {40441#true} {40995#(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; {40995#(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-08 06:34:51,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,374 INFO L290 TraceCheckUtils]: 51: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,374 INFO L272 TraceCheckUtils]: 50: Hoare triple {40995#(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)); {40441#true} is VALID [2022-04-08 06:34:51,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {40995#(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 < 50);havoc #t~post6; {40995#(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-08 06:34:51,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {40995#(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; {40995#(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-08 06:34:51,377 INFO L290 TraceCheckUtils]: 47: Hoare triple {41050#(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; {40995#(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-08 06:34:51,378 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {40441#true} {41050#(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; {41050#(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-08 06:34:51,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,378 INFO L272 TraceCheckUtils]: 42: Hoare triple {41050#(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)); {40441#true} is VALID [2022-04-08 06:34:51,379 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {40441#true} {41050#(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; {41050#(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-08 06:34:51,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,379 INFO L272 TraceCheckUtils]: 37: Hoare triple {41050#(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)); {40441#true} is VALID [2022-04-08 06:34:51,380 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {40441#true} {41050#(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; {41050#(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-08 06:34:51,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,380 INFO L272 TraceCheckUtils]: 32: Hoare triple {41050#(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)); {40441#true} is VALID [2022-04-08 06:34:51,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {41050#(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 < 50);havoc #t~post6; {41050#(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-08 06:34:51,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {41050#(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; {41050#(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-08 06:34:51,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {41050#(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-08 06:34:51,384 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {40441#true} {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} #86#return; {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} is VALID [2022-04-08 06:34:51,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,384 INFO L272 TraceCheckUtils]: 24: Hoare triple {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {40441#true} is VALID [2022-04-08 06:34:51,385 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40441#true} {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} #84#return; {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} is VALID [2022-04-08 06:34:51,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,385 INFO L272 TraceCheckUtils]: 19: Hoare triple {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {40441#true} is VALID [2022-04-08 06:34:51,386 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {40441#true} {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} #82#return; {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} is VALID [2022-04-08 06:34:51,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,386 INFO L272 TraceCheckUtils]: 14: Hoare triple {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {40441#true} is VALID [2022-04-08 06:34:51,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} is VALID [2022-04-08 06:34:51,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} is VALID [2022-04-08 06:34:51,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {40441#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {41105#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 16) 2)) main_~r~0 (* (+ main_~q~0 (div (* main_~p~0 16) 2)) (mod main_~B~0 4294967296)))) (not (<= (* main_~d~0 8) main_~r~0)) (<= (* main_~d~0 16) main_~r~0))} is VALID [2022-04-08 06:34:51,392 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40441#true} {40441#true} #80#return; {40441#true} is VALID [2022-04-08 06:34:51,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {40441#true} assume !(0 == ~cond); {40441#true} is VALID [2022-04-08 06:34:51,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {40441#true} ~cond := #in~cond; {40441#true} is VALID [2022-04-08 06:34:51,392 INFO L272 TraceCheckUtils]: 6: Hoare triple {40441#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40441#true} is VALID [2022-04-08 06:34:51,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {40441#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; {40441#true} is VALID [2022-04-08 06:34:51,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {40441#true} call #t~ret8 := main(); {40441#true} is VALID [2022-04-08 06:34:51,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40441#true} {40441#true} #96#return; {40441#true} is VALID [2022-04-08 06:34:51,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {40441#true} assume true; {40441#true} is VALID [2022-04-08 06:34:51,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {40441#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {40441#true} is VALID [2022-04-08 06:34:51,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {40441#true} call ULTIMATE.init(); {40441#true} is VALID [2022-04-08 06:34:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 34 proven. 63 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-08 06:34:51,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:34:51,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714671823] [2022-04-08 06:34:51,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:34:51,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304178122] [2022-04-08 06:34:51,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304178122] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:34:51,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:34:51,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2022-04-08 06:34:51,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:34:51,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2021617520] [2022-04-08 06:34:51,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2021617520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:34:51,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:34:51,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 06:34:51,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270219159] [2022-04-08 06:34:51,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:34:51,396 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) Word has length 122 [2022-04-08 06:34:51,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:34:51,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2022-04-08 06:34:51,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:34:51,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 06:34:51,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:34:51,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 06:34:51,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-04-08 06:34:51,532 INFO L87 Difference]: Start difference. First operand 269 states and 304 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2022-04-08 06:34:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:34:55,540 INFO L93 Difference]: Finished difference Result 328 states and 385 transitions. [2022-04-08 06:34:55,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 06:34:55,541 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) Word has length 122 [2022-04-08 06:34:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:34:55,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2022-04-08 06:34:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 144 transitions. [2022-04-08 06:34:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2022-04-08 06:34:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 144 transitions. [2022-04-08 06:34:55,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 144 transitions. [2022-04-08 06:34:55,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:34:55,775 INFO L225 Difference]: With dead ends: 328 [2022-04-08 06:34:55,775 INFO L226 Difference]: Without dead ends: 283 [2022-04-08 06:34:55,776 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2022-04-08 06:34:55,776 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 45 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 06:34:55,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 348 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 06:34:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-08 06:34:56,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 280. [2022-04-08 06:34:56,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:34:56,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 280 states, 186 states have (on average 1.1344086021505377) internal successors, (211), 193 states have internal predecessors, (211), 55 states have call successors, (55), 39 states have call predecessors, (55), 38 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 06:34:56,138 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 280 states, 186 states have (on average 1.1344086021505377) internal successors, (211), 193 states have internal predecessors, (211), 55 states have call successors, (55), 39 states have call predecessors, (55), 38 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 06:34:56,138 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 280 states, 186 states have (on average 1.1344086021505377) internal successors, (211), 193 states have internal predecessors, (211), 55 states have call successors, (55), 39 states have call predecessors, (55), 38 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 06:34:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:34:56,141 INFO L93 Difference]: Finished difference Result 283 states and 323 transitions. [2022-04-08 06:34:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 323 transitions. [2022-04-08 06:34:56,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:34:56,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:34:56,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 280 states, 186 states have (on average 1.1344086021505377) internal successors, (211), 193 states have internal predecessors, (211), 55 states have call successors, (55), 39 states have call predecessors, (55), 38 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) Second operand 283 states. [2022-04-08 06:34:56,142 INFO L87 Difference]: Start difference. First operand has 280 states, 186 states have (on average 1.1344086021505377) internal successors, (211), 193 states have internal predecessors, (211), 55 states have call successors, (55), 39 states have call predecessors, (55), 38 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) Second operand 283 states. [2022-04-08 06:34:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:34:56,146 INFO L93 Difference]: Finished difference Result 283 states and 323 transitions. [2022-04-08 06:34:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 323 transitions. [2022-04-08 06:34:56,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:34:56,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:34:56,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:34:56,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:34:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 186 states have (on average 1.1344086021505377) internal successors, (211), 193 states have internal predecessors, (211), 55 states have call successors, (55), 39 states have call predecessors, (55), 38 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 06:34:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 318 transitions. [2022-04-08 06:34:56,151 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 318 transitions. Word has length 122 [2022-04-08 06:34:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:34:56,151 INFO L478 AbstractCegarLoop]: Abstraction has 280 states and 318 transitions. [2022-04-08 06:34:56,151 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2022-04-08 06:34:56,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 280 states and 318 transitions. [2022-04-08 06:34:58,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 317 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:34:58,802 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 318 transitions. [2022-04-08 06:34:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-08 06:34:58,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:34:58,803 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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-08 06:34:58,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 06:34:59,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:34:59,007 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:34:59,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:34:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1079646078, now seen corresponding path program 21 times [2022-04-08 06:34:59,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:34:59,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1988475428] [2022-04-08 06:35:05,236 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:35:05,236 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:35:05,236 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:35:05,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1079646078, now seen corresponding path program 22 times [2022-04-08 06:35:05,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:35:05,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278194578] [2022-04-08 06:35:05,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:35:05,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:35:05,251 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:35:05,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2043534821] [2022-04-08 06:35:05,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:35:05,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:35:05,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:35:05,253 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:35:05,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 06:35:05,308 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:35:05,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:35:05,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 06:35:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:35:05,334 INFO L286 TraceCheckSpWp]: Computing forward predicates...