/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:22:27,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:22:27,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:22:27,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:22:27,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:22:27,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:22:27,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:22:27,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:22:27,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:22:27,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:22:27,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:22:27,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:22:27,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:22:27,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:22:27,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:22:27,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:22:27,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:22:27,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:22:27,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:22:27,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:22:27,148 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:22:27,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:22:27,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:22:27,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:22:27,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:22:27,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:22:27,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:22:27,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:22:27,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:22:27,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:22:27,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:22:27,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:22:27,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:22:27,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:22:27,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:22:27,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:22:27,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:22:27,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:22:27,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:22:27,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:22:27,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:22:27,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:22:27,163 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:22:27,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:22:27,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:22:27,187 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:22:27,187 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:22:27,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:22:27,188 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:22:27,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:22:27,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:22:27,188 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:22:27,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:22:27,189 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:22:27,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:22:27,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:22:27,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:22:27,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:22:27,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:22:27,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:22:27,190 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:22:27,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:22:27,190 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:22:27,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:22:27,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:22:27,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:22:27,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:22:27,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:22:27,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:22:27,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:22:27,191 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:22:27,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:22:27,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:22:27,191 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:22:27,191 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:22:27,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:22:27,192 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 13:22:27,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:22:27,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:22:27,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:22:27,394 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:22:27,394 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:22:27,395 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-27 13:22:27,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fcb386b9/258354c36b06446db8b1d8fd0a371c1e/FLAG752a16111 [2022-04-27 13:22:27,761 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:22:27,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound50.c [2022-04-27 13:22:27,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fcb386b9/258354c36b06446db8b1d8fd0a371c1e/FLAG752a16111 [2022-04-27 13:22:28,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fcb386b9/258354c36b06446db8b1d8fd0a371c1e [2022-04-27 13:22:28,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:22:28,217 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:22:28,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:22:28,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:22:28,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:22:28,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:22:28" (1/1) ... [2022-04-27 13:22:28,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34689c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:28, skipping insertion in model container [2022-04-27 13:22:28,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:22:28" (1/1) ... [2022-04-27 13:22:28,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:22:28,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:22:28,361 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-27 13:22:28,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:22:28,394 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:22:28,404 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-27 13:22:28,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:22:28,429 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:22:28,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:28 WrapperNode [2022-04-27 13:22:28,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:22:28,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:22:28,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:22:28,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:22:28,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:28" (1/1) ... [2022-04-27 13:22:28,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:28" (1/1) ... [2022-04-27 13:22:28,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:28" (1/1) ... [2022-04-27 13:22:28,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:28" (1/1) ... [2022-04-27 13:22:28,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:28" (1/1) ... [2022-04-27 13:22:28,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:28" (1/1) ... [2022-04-27 13:22:28,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:28" (1/1) ... [2022-04-27 13:22:28,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:22:28,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:22:28,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:22:28,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:22:28,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:28" (1/1) ... [2022-04-27 13:22:28,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:22:28,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:28,508 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-27 13:22:28,522 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-27 13:22:28,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:22:28,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:22:28,538 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:22:28,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:22:28,539 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:22:28,539 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:22:28,539 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:22:28,539 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:22:28,539 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:22:28,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:22:28,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:22:28,540 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:22:28,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:22:28,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:22:28,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:22:28,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:22:28,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:22:28,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:22:28,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:22:28,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:22:28,587 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:22:28,588 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:22:28,737 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:22:28,743 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:22:28,743 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:22:28,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:22:28 BoogieIcfgContainer [2022-04-27 13:22:28,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:22:28,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:22:28,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:22:28,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:22:28,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:22:28" (1/3) ... [2022-04-27 13:22:28,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f749763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:22:28, skipping insertion in model container [2022-04-27 13:22:28,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:28" (2/3) ... [2022-04-27 13:22:28,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f749763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:22:28, skipping insertion in model container [2022-04-27 13:22:28,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:22:28" (3/3) ... [2022-04-27 13:22:28,754 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound50.c [2022-04-27 13:22:28,778 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:22:28,778 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:22:28,825 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:22:28,841 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@481c9ac0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@400e526a [2022-04-27 13:22:28,841 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:22:28,862 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-27 13:22:28,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:22:28,867 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:28,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:28,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:28,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-27 13:22:28,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:28,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264095577] [2022-04-27 13:22:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:28,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:29,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:22:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:29,048 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-27 13:22:29,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:22:29,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:22:29,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:22:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:29,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:22:29,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:22:29,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:22:29,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:22:29,063 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-27 13:22:29,063 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-27 13:22:29,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:22:29,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:22:29,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-27 13:22:29,064 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-27 13:22:29,064 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-27 13:22:29,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:22:29,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:22:29,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:22:29,065 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:22:29,065 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-27 13:22:29,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:22:29,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:22:29,066 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-27 13:22:29,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:22:29,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:22:29,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:22:29,068 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-27 13:22:29,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:29,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264095577] [2022-04-27 13:22:29,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264095577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:29,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:29,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:22:29,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844816497] [2022-04-27 13:22:29,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:29,075 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-27 13:22:29,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:29,078 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-27 13:22:29,105 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-27 13:22:29,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:22:29,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:29,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:22:29,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:22:29,125 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-27 13:22:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:29,307 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-27 13:22:29,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:22:29,308 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-27 13:22:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:29,309 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-27 13:22:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:22:29,322 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-27 13:22:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:22:29,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-27 13:22:29,429 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-27 13:22:29,435 INFO L225 Difference]: With dead ends: 66 [2022-04-27 13:22:29,435 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 13:22:29,437 INFO L412 NwaCegarLoop]: 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-27 13:22:29,440 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:29,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:22:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 13:22:29,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-27 13:22:29,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:29,465 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-27 13:22:29,465 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-27 13:22:29,469 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-27 13:22:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:29,472 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:22:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:22:29,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:29,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:29,474 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-27 13:22:29,474 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-27 13:22:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:29,477 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:22:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:22:29,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:29,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:29,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:29,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:29,478 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-27 13:22:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 13:22:29,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-27 13:22:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:29,481 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 13:22:29,481 INFO L496 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-27 13:22:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 13:22:29,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:22:29,482 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:29,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:29,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:22:29,483 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:29,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-27 13:22:29,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:29,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174807392] [2022-04-27 13:22:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:29,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:29,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:22:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:29,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(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; {256#true} is VALID [2022-04-27 13:22:29,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:22:29,557 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:22:29,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:22:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:29,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:22:29,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:22:29,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:22:29,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:22:29,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:22:29,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(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; {256#true} is VALID [2022-04-27 13:22:29,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:22:29,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:22:29,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret8 := main(); {256#true} is VALID [2022-04-27 13:22:29,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#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; {256#true} is VALID [2022-04-27 13:22:29,562 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {256#true} is VALID [2022-04-27 13:22:29,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:22:29,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:22:29,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:22:29,563 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:22:29,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:22:29,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:22:29,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(= main_~q~0 0)} assume !!(#t~post6 < 50);havoc #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:22:29,564 INFO L272 TraceCheckUtils]: 14: Hoare triple {265#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:22:29,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:22:29,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-27 13:22:29,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 13:22:29,565 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-27 13:22:29,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:29,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174807392] [2022-04-27 13:22:29,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174807392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:29,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:29,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:22:29,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442043849] [2022-04-27 13:22:29,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:29,567 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-27 13:22:29,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:29,567 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-27 13:22:29,580 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-27 13:22:29,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:22:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:29,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:22:29,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:22:29,581 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-27 13:22:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:29,849 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:22:29,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:22:29,849 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-27 13:22:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:29,849 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-27 13:22:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:22:29,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-27 13:22:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:22:29,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:22:29,902 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-27 13:22:29,903 INFO L225 Difference]: With dead ends: 47 [2022-04-27 13:22:29,903 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 13:22:29,903 INFO L412 NwaCegarLoop]: 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-27 13:22:29,904 INFO L413 NwaCegarLoop]: 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-27 13:22:29,905 INFO L414 NwaCegarLoop]: 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-27 13:22:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 13:22:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-27 13:22:29,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:29,909 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-27 13:22:29,909 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-27 13:22:29,910 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-27 13:22:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:29,912 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:22:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:22:29,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:29,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:29,913 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-27 13:22:29,913 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-27 13:22:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:29,915 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:22:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:22:29,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:29,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:29,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:29,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:29,916 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-27 13:22:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-27 13:22:29,918 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-27 13:22:29,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:29,918 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-27 13:22:29,918 INFO L496 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-27 13:22:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-27 13:22:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 13:22:29,919 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:29,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:29,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:22:29,919 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:29,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:29,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-27 13:22:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:29,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956498010] [2022-04-27 13:22:29,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:29,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:29,933 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:29,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391740381] [2022-04-27 13:22:29,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:29,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:29,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:29,935 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-27 13:22:29,936 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-27 13:22:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:29,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:22:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:29,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:30,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2022-04-27 13:22:30,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:30,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:30,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#(<= ~counter~0 0)} {489#true} #96#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:30,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#(<= ~counter~0 0)} call #t~ret8 := main(); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:30,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#(<= ~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; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:30,089 INFO L272 TraceCheckUtils]: 6: Hoare triple {497#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:30,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#(<= ~counter~0 0)} ~cond := #in~cond; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:30,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#(<= ~counter~0 0)} assume !(0 == ~cond); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:30,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:30,091 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {497#(<= ~counter~0 0)} {497#(<= ~counter~0 0)} #80#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:30,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:30,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {497#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {531#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:22:30,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {490#false} is VALID [2022-04-27 13:22:30,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {490#false} is VALID [2022-04-27 13:22:30,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !(#t~post7 < 50);havoc #t~post7; {490#false} is VALID [2022-04-27 13:22:30,092 INFO L272 TraceCheckUtils]: 16: Hoare triple {490#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {490#false} is VALID [2022-04-27 13:22:30,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-27 13:22:30,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-27 13:22:30,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-27 13:22:30,093 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-27 13:22:30,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:22:30,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:30,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956498010] [2022-04-27 13:22:30,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:30,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391740381] [2022-04-27 13:22:30,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391740381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:30,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:30,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:22:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781116231] [2022-04-27 13:22:30,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:30,095 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-27 13:22:30,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:30,095 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-27 13:22:30,108 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-27 13:22:30,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:22:30,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:30,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:22:30,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:22:30,109 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-27 13:22:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:30,174 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-27 13:22:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:22:30,175 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-27 13:22:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:30,175 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-27 13:22:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:22:30,176 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-27 13:22:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:22:30,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-27 13:22:30,221 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-27 13:22:30,222 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:22:30,222 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 13:22:30,223 INFO L412 NwaCegarLoop]: 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-27 13:22:30,224 INFO L413 NwaCegarLoop]: 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-27 13:22:30,224 INFO L414 NwaCegarLoop]: 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-27 13:22:30,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 13:22:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 13:22:30,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:30,230 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-27 13:22:30,231 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-27 13:22:30,231 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-27 13:22:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:30,233 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:22:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:22:30,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:30,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:30,234 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-27 13:22:30,234 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-27 13:22:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:30,235 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:22:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:22:30,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:30,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:30,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:30,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:30,236 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-27 13:22:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-27 13:22:30,238 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-27 13:22:30,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:30,238 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-27 13:22:30,238 INFO L496 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-27 13:22:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:22:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:22:30,239 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:30,239 INFO L195 NwaCegarLoop]: 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-27 13:22:30,256 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-27 13:22:30,456 WARN L477 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-27 13:22:30,457 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:30,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:30,457 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-27 13:22:30,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:30,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806439251] [2022-04-27 13:22:30,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:30,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:22:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:30,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {773#(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; {757#true} is VALID [2022-04-27 13:22:30,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:30,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:22:30,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:22:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:30,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:22:30,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:22:30,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:30,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:22:30,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 13:22:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:30,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:22:30,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:22:30,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:30,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #82#return; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:30,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {757#true} call ULTIMATE.init(); {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:22:30,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {773#(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; {757#true} is VALID [2022-04-27 13:22:30,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:30,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:22:30,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} call #t~ret8 := main(); {757#true} is VALID [2022-04-27 13:22:30,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {757#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; {757#true} is VALID [2022-04-27 13:22:30,566 INFO L272 TraceCheckUtils]: 6: Hoare triple {757#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {757#true} is VALID [2022-04-27 13:22:30,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:22:30,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:22:30,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:30,566 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:22:30,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {757#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:30,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:30,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} assume !!(#t~post6 < 50);havoc #t~post6; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:30,571 INFO L272 TraceCheckUtils]: 14: Hoare triple {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {757#true} is VALID [2022-04-27 13:22:30,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:22:30,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:22:30,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:30,572 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {757#true} {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #82#return; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:30,573 INFO L272 TraceCheckUtils]: 19: Hoare triple {766#(= 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)); {771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:22:30,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {771#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {772#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:22:30,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {772#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {758#false} is VALID [2022-04-27 13:22:30,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} assume !false; {758#false} is VALID [2022-04-27 13:22:30,576 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-27 13:22:30,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:30,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806439251] [2022-04-27 13:22:30,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806439251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:30,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:30,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:22:30,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452318890] [2022-04-27 13:22:30,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:30,577 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-27 13:22:30,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:30,577 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-27 13:22:30,594 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-27 13:22:30,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:22:30,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:30,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:22:30,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:22:30,598 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-27 13:22:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:30,941 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:22:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:22:30,941 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-27 13:22:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:30,942 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-27 13:22:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:22:30,943 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-27 13:22:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:22:30,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:22:30,996 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-27 13:22:30,997 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:22:30,997 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:22:30,998 INFO L412 NwaCegarLoop]: 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-27 13:22:30,998 INFO L413 NwaCegarLoop]: 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-27 13:22:30,999 INFO L414 NwaCegarLoop]: 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-27 13:22:30,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:22:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-27 13:22:31,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:31,005 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-27 13:22:31,005 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-27 13:22:31,005 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-27 13:22:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:31,007 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:22:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:22:31,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:31,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:31,008 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-27 13:22:31,008 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-27 13:22:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:31,010 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:22:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:22:31,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:31,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:31,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:31,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:31,011 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-27 13:22:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-27 13:22:31,012 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-27 13:22:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:31,012 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-27 13:22:31,012 INFO L496 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-27 13:22:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-27 13:22:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:22:31,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:31,013 INFO L195 NwaCegarLoop]: 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-27 13:22:31,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 13:22:31,013 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:31,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-27 13:22:31,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:31,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415495674] [2022-04-27 13:22:31,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:31,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:31,022 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:31,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326305380] [2022-04-27 13:22:31,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:31,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:31,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:31,023 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-27 13:22:31,024 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-27 13:22:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:31,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:22:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:31,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:31,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {1018#true} call ULTIMATE.init(); {1018#true} is VALID [2022-04-27 13:22:31,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {1018#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {1018#true} is VALID [2022-04-27 13:22:31,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:22:31,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1018#true} {1018#true} #96#return; {1018#true} is VALID [2022-04-27 13:22:31,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {1018#true} call #t~ret8 := main(); {1018#true} is VALID [2022-04-27 13:22:31,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {1018#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; {1018#true} is VALID [2022-04-27 13:22:31,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {1018#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:22:31,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:22:31,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:22:31,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:22:31,153 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1018#true} {1018#true} #80#return; {1018#true} is VALID [2022-04-27 13:22:31,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:31,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:31,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:31,154 INFO L272 TraceCheckUtils]: 14: Hoare triple {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:22:31,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:22:31,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:22:31,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:22:31,155 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1018#true} {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:31,155 INFO L272 TraceCheckUtils]: 19: Hoare triple {1056#(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)); {1018#true} is VALID [2022-04-27 13:22:31,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:22:31,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:22:31,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:22:31,156 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1018#true} {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:31,157 INFO L272 TraceCheckUtils]: 24: Hoare triple {1056#(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)); {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:31,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:31,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {1100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1019#false} is VALID [2022-04-27 13:22:31,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#false} assume !false; {1019#false} is VALID [2022-04-27 13:22:31,158 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-27 13:22:31,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:22:31,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:31,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415495674] [2022-04-27 13:22:31,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:31,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326305380] [2022-04-27 13:22:31,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326305380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:31,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:31,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:22:31,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544182317] [2022-04-27 13:22:31,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:31,159 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-27 13:22:31,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:31,160 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-27 13:22:31,175 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-27 13:22:31,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:22:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:31,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:22:31,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:22:31,176 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-27 13:22:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:31,346 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-27 13:22:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:22:31,346 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-27 13:22:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:31,346 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-27 13:22:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-04-27 13:22:31,348 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-27 13:22:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-04-27 13:22:31,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 87 transitions. [2022-04-27 13:22:31,414 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-27 13:22:31,415 INFO L225 Difference]: With dead ends: 71 [2022-04-27 13:22:31,415 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 13:22:31,415 INFO L412 NwaCegarLoop]: 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-27 13:22:31,416 INFO L413 NwaCegarLoop]: 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-27 13:22:31,416 INFO L414 NwaCegarLoop]: 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-27 13:22:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 13:22:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 13:22:31,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:31,425 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-27 13:22:31,425 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-27 13:22:31,425 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-27 13:22:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:31,427 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-27 13:22:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-27 13:22:31,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:31,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:31,428 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-27 13:22:31,428 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-27 13:22:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:31,430 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-27 13:22:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-27 13:22:31,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:31,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:31,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:31,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:31,430 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-27 13:22:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-27 13:22:31,432 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 28 [2022-04-27 13:22:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:31,432 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-27 13:22:31,432 INFO L496 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-27 13:22:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-27 13:22:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:22:31,433 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:31,433 INFO L195 NwaCegarLoop]: 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-27 13:22:31,449 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-27 13:22:31,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:31,648 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:31,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-27 13:22:31,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:31,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121890908] [2022-04-27 13:22:31,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:31,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:31,658 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:31,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046384531] [2022-04-27 13:22:31,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:31,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:31,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:31,659 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-27 13:22:31,660 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-27 13:22:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:31,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:22:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:31,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:31,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {1403#true} call ULTIMATE.init(); {1403#true} is VALID [2022-04-27 13:22:31,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {1403#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:31,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {1411#(<= ~counter~0 0)} assume true; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:31,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1411#(<= ~counter~0 0)} {1403#true} #96#return; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:31,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {1411#(<= ~counter~0 0)} call #t~ret8 := main(); {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:31,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {1411#(<= ~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; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:31,836 INFO L272 TraceCheckUtils]: 6: Hoare triple {1411#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:31,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {1411#(<= ~counter~0 0)} ~cond := #in~cond; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:31,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {1411#(<= ~counter~0 0)} assume !(0 == ~cond); {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:31,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {1411#(<= ~counter~0 0)} assume true; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:31,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1411#(<= ~counter~0 0)} {1411#(<= ~counter~0 0)} #80#return; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:31,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {1411#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:31,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {1411#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {1445#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,839 INFO L272 TraceCheckUtils]: 14: Hoare triple {1445#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {1445#(<= ~counter~0 1)} ~cond := #in~cond; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {1445#(<= ~counter~0 1)} assume !(0 == ~cond); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {1445#(<= ~counter~0 1)} assume true; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,840 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1445#(<= ~counter~0 1)} {1445#(<= ~counter~0 1)} #82#return; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,841 INFO L272 TraceCheckUtils]: 19: Hoare triple {1445#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {1445#(<= ~counter~0 1)} ~cond := #in~cond; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {1445#(<= ~counter~0 1)} assume !(0 == ~cond); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {1445#(<= ~counter~0 1)} assume true; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,842 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1445#(<= ~counter~0 1)} {1445#(<= ~counter~0 1)} #84#return; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,842 INFO L272 TraceCheckUtils]: 24: Hoare triple {1445#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {1445#(<= ~counter~0 1)} ~cond := #in~cond; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {1445#(<= ~counter~0 1)} assume !(0 == ~cond); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {1445#(<= ~counter~0 1)} assume true; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,844 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1445#(<= ~counter~0 1)} {1445#(<= ~counter~0 1)} #86#return; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {1445#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:31,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {1445#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1500#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:22:31,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {1500#(<= |main_#t~post7| 1)} assume !(#t~post7 < 50);havoc #t~post7; {1404#false} is VALID [2022-04-27 13:22:31,845 INFO L272 TraceCheckUtils]: 32: Hoare triple {1404#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1404#false} is VALID [2022-04-27 13:22:31,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {1404#false} ~cond := #in~cond; {1404#false} is VALID [2022-04-27 13:22:31,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {1404#false} assume 0 == ~cond; {1404#false} is VALID [2022-04-27 13:22:31,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {1404#false} assume !false; {1404#false} is VALID [2022-04-27 13:22:31,845 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-27 13:22:31,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:22:31,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:31,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121890908] [2022-04-27 13:22:31,846 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:31,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046384531] [2022-04-27 13:22:31,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046384531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:31,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:31,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:22:31,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999780154] [2022-04-27 13:22:31,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:31,846 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-27 13:22:31,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:31,847 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-27 13:22:31,866 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-27 13:22:31,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:22:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:31,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:22:31,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:22:31,867 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-27 13:22:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:31,975 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-04-27 13:22:31,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:22:31,975 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-27 13:22:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:31,975 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-27 13:22:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:22:31,976 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-27 13:22:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:22:31,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:22:32,027 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-27 13:22:32,028 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:22:32,028 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 13:22:32,028 INFO L412 NwaCegarLoop]: 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-27 13:22:32,029 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:32,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:22:32,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 13:22:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-27 13:22:32,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:32,041 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-27 13:22:32,041 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-27 13:22:32,041 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-27 13:22:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:32,043 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-27 13:22:32,043 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-27 13:22:32,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:32,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:32,043 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-27 13:22:32,044 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-27 13:22:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:32,045 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-27 13:22:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-27 13:22:32,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:32,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:32,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:32,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:32,046 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-27 13:22:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-04-27 13:22:32,048 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 36 [2022-04-27 13:22:32,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:32,048 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-04-27 13:22:32,048 INFO L496 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-27 13:22:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-04-27 13:22:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:22:32,048 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:32,048 INFO L195 NwaCegarLoop]: 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-27 13:22:32,067 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-27 13:22:32,269 WARN L477 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-27 13:22:32,270 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:32,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:32,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-27 13:22:32,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:32,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789728341] [2022-04-27 13:22:32,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:32,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:32,281 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:32,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96183834] [2022-04-27 13:22:32,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:32,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:32,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:32,282 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-27 13:22:32,283 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-27 13:22:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:32,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:22:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:32,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:32,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {1856#true} call ULTIMATE.init(); {1856#true} is VALID [2022-04-27 13:22:32,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {1856#true} is VALID [2022-04-27 13:22:32,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:32,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} #96#return; {1856#true} is VALID [2022-04-27 13:22:32,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {1856#true} call #t~ret8 := main(); {1856#true} is VALID [2022-04-27 13:22:32,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {1856#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; {1856#true} is VALID [2022-04-27 13:22:32,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {1856#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1856#true} is VALID [2022-04-27 13:22:32,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 13:22:32,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 13:22:32,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:32,838 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1856#true} {1856#true} #80#return; {1856#true} is VALID [2022-04-27 13:22:32,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {1856#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:32,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:32,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:32,849 INFO L272 TraceCheckUtils]: 14: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1856#true} is VALID [2022-04-27 13:22:32,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 13:22:32,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 13:22:32,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:32,850 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1856#true} {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #82#return; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:32,850 INFO L272 TraceCheckUtils]: 19: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1856#true} is VALID [2022-04-27 13:22:32,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 13:22:32,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 13:22:32,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:32,851 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1856#true} {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #84#return; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:32,851 INFO L272 TraceCheckUtils]: 24: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1856#true} is VALID [2022-04-27 13:22:32,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 13:22:32,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 13:22:32,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:32,852 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1856#true} {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #86#return; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:32,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:32,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:32,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:32,857 INFO L272 TraceCheckUtils]: 32: Hoare triple {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {1959#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:32,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {1959#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1963#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:32,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {1963#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1857#false} is VALID [2022-04-27 13:22:32,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {1857#false} assume !false; {1857#false} is VALID [2022-04-27 13:22:32,858 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-27 13:22:32,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:22:32,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:32,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789728341] [2022-04-27 13:22:32,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:32,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96183834] [2022-04-27 13:22:32,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96183834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:32,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:32,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:22:32,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925531342] [2022-04-27 13:22:32,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:32,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-27 13:22:32,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:32,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-27 13:22:32,885 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-27 13:22:32,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:22:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:32,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:22:32,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:22:32,886 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-27 13:22:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:33,138 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-04-27 13:22:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:22:33,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-27 13:22:33,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-27 13:22:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-27 13:22:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-27 13:22:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-27 13:22:33,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-27 13:22:33,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-27 13:22:33,228 INFO L225 Difference]: With dead ends: 74 [2022-04-27 13:22:33,228 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 13:22:33,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:22:33,229 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:33,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 160 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:22:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 13:22:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 13:22:33,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:33,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:33,251 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:33,252 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:33,255 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-27 13:22:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 13:22:33,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:33,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:33,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 58 states. [2022-04-27 13:22:33,256 INFO L87 Difference]: Start difference. First operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 58 states. [2022-04-27 13:22:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:33,259 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-27 13:22:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 13:22:33,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:33,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:33,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:33,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-27 13:22:33,262 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 36 [2022-04-27 13:22:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:33,262 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-27 13:22:33,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-27 13:22:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 13:22:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 13:22:33,264 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:33,264 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2022-04-27 13:22:33,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 13:22:33,479 WARN L477 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-27 13:22:33,479 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:33,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times [2022-04-27 13:22:33,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:33,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840396825] [2022-04-27 13:22:33,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:33,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:33,490 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:33,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [815149313] [2022-04-27 13:22:33,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:33,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:33,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:33,500 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-27 13:22:33,501 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-27 13:22:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:33,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:22:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:33,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:33,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {2274#true} call ULTIMATE.init(); {2274#true} is VALID [2022-04-27 13:22:33,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {2274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:33,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {2282#(<= ~counter~0 0)} assume true; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:33,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2282#(<= ~counter~0 0)} {2274#true} #96#return; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:33,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {2282#(<= ~counter~0 0)} call #t~ret8 := main(); {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:33,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {2282#(<= ~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; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:33,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {2282#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:33,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {2282#(<= ~counter~0 0)} ~cond := #in~cond; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:33,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {2282#(<= ~counter~0 0)} assume !(0 == ~cond); {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:33,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {2282#(<= ~counter~0 0)} assume true; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:33,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2282#(<= ~counter~0 0)} {2282#(<= ~counter~0 0)} #80#return; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:33,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {2282#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:33,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {2282#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {2316#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,669 INFO L272 TraceCheckUtils]: 14: Hoare triple {2316#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {2316#(<= ~counter~0 1)} ~cond := #in~cond; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {2316#(<= ~counter~0 1)} assume !(0 == ~cond); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {2316#(<= ~counter~0 1)} assume true; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,670 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2316#(<= ~counter~0 1)} {2316#(<= ~counter~0 1)} #82#return; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,671 INFO L272 TraceCheckUtils]: 19: Hoare triple {2316#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {2316#(<= ~counter~0 1)} ~cond := #in~cond; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {2316#(<= ~counter~0 1)} assume !(0 == ~cond); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {2316#(<= ~counter~0 1)} assume true; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,672 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2316#(<= ~counter~0 1)} {2316#(<= ~counter~0 1)} #84#return; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,672 INFO L272 TraceCheckUtils]: 24: Hoare triple {2316#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {2316#(<= ~counter~0 1)} ~cond := #in~cond; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {2316#(<= ~counter~0 1)} assume !(0 == ~cond); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {2316#(<= ~counter~0 1)} assume true; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,673 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2316#(<= ~counter~0 1)} {2316#(<= ~counter~0 1)} #86#return; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {2316#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:33,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {2316#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2371#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:22:33,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {2371#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {2275#false} is VALID [2022-04-27 13:22:33,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {2275#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2275#false} is VALID [2022-04-27 13:22:33,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {2275#false} assume !(#t~post7 < 50);havoc #t~post7; {2275#false} is VALID [2022-04-27 13:22:33,674 INFO L272 TraceCheckUtils]: 34: Hoare triple {2275#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2275#false} is VALID [2022-04-27 13:22:33,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {2275#false} ~cond := #in~cond; {2275#false} is VALID [2022-04-27 13:22:33,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {2275#false} assume 0 == ~cond; {2275#false} is VALID [2022-04-27 13:22:33,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {2275#false} assume !false; {2275#false} is VALID [2022-04-27 13:22:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:22:33,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:22:33,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {2275#false} assume !false; {2275#false} is VALID [2022-04-27 13:22:33,840 INFO L290 TraceCheckUtils]: 36: Hoare triple {2275#false} assume 0 == ~cond; {2275#false} is VALID [2022-04-27 13:22:33,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {2275#false} ~cond := #in~cond; {2275#false} is VALID [2022-04-27 13:22:33,840 INFO L272 TraceCheckUtils]: 34: Hoare triple {2275#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2275#false} is VALID [2022-04-27 13:22:33,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {2275#false} assume !(#t~post7 < 50);havoc #t~post7; {2275#false} is VALID [2022-04-27 13:22:33,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {2275#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2275#false} is VALID [2022-04-27 13:22:33,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {2411#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {2275#false} is VALID [2022-04-27 13:22:33,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {2415#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2411#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:22:33,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {2415#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2415#(< ~counter~0 50)} is VALID [2022-04-27 13:22:33,844 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2274#true} {2415#(< ~counter~0 50)} #86#return; {2415#(< ~counter~0 50)} is VALID [2022-04-27 13:22:33,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 13:22:33,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {2274#true} assume !(0 == ~cond); {2274#true} is VALID [2022-04-27 13:22:33,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {2274#true} ~cond := #in~cond; {2274#true} is VALID [2022-04-27 13:22:33,844 INFO L272 TraceCheckUtils]: 24: Hoare triple {2415#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2274#true} is VALID [2022-04-27 13:22:33,849 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2274#true} {2415#(< ~counter~0 50)} #84#return; {2415#(< ~counter~0 50)} is VALID [2022-04-27 13:22:33,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 13:22:33,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {2274#true} assume !(0 == ~cond); {2274#true} is VALID [2022-04-27 13:22:33,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {2274#true} ~cond := #in~cond; {2274#true} is VALID [2022-04-27 13:22:33,850 INFO L272 TraceCheckUtils]: 19: Hoare triple {2415#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2274#true} is VALID [2022-04-27 13:22:33,850 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2274#true} {2415#(< ~counter~0 50)} #82#return; {2415#(< ~counter~0 50)} is VALID [2022-04-27 13:22:33,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 13:22:33,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {2274#true} assume !(0 == ~cond); {2274#true} is VALID [2022-04-27 13:22:33,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {2274#true} ~cond := #in~cond; {2274#true} is VALID [2022-04-27 13:22:33,851 INFO L272 TraceCheckUtils]: 14: Hoare triple {2415#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2274#true} is VALID [2022-04-27 13:22:33,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {2415#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {2415#(< ~counter~0 50)} is VALID [2022-04-27 13:22:33,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {2470#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2415#(< ~counter~0 50)} is VALID [2022-04-27 13:22:33,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {2470#(< ~counter~0 49)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2470#(< ~counter~0 49)} is VALID [2022-04-27 13:22:33,852 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2274#true} {2470#(< ~counter~0 49)} #80#return; {2470#(< ~counter~0 49)} is VALID [2022-04-27 13:22:33,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 13:22:33,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {2274#true} assume !(0 == ~cond); {2274#true} is VALID [2022-04-27 13:22:33,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {2274#true} ~cond := #in~cond; {2274#true} is VALID [2022-04-27 13:22:33,852 INFO L272 TraceCheckUtils]: 6: Hoare triple {2470#(< ~counter~0 49)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2274#true} is VALID [2022-04-27 13:22:33,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {2470#(< ~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; {2470#(< ~counter~0 49)} is VALID [2022-04-27 13:22:33,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {2470#(< ~counter~0 49)} call #t~ret8 := main(); {2470#(< ~counter~0 49)} is VALID [2022-04-27 13:22:33,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2470#(< ~counter~0 49)} {2274#true} #96#return; {2470#(< ~counter~0 49)} is VALID [2022-04-27 13:22:33,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {2470#(< ~counter~0 49)} assume true; {2470#(< ~counter~0 49)} is VALID [2022-04-27 13:22:33,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {2274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {2470#(< ~counter~0 49)} is VALID [2022-04-27 13:22:33,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {2274#true} call ULTIMATE.init(); {2274#true} is VALID [2022-04-27 13:22:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:22:33,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:33,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840396825] [2022-04-27 13:22:33,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:33,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815149313] [2022-04-27 13:22:33,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815149313] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:22:33,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:22:33,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:22:33,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713427747] [2022-04-27 13:22:33,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:22:33,855 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 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 38 [2022-04-27 13:22:33,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:33,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 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-27 13:22:33,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:33,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:22:33,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:33,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:22:33,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:22:33,902 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 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-27 13:22:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:34,163 INFO L93 Difference]: Finished difference Result 123 states and 147 transitions. [2022-04-27 13:22:34,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:22:34,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 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 38 [2022-04-27 13:22:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 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-27 13:22:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2022-04-27 13:22:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 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-27 13:22:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2022-04-27 13:22:34,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 123 transitions. [2022-04-27 13:22:34,251 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-27 13:22:34,254 INFO L225 Difference]: With dead ends: 123 [2022-04-27 13:22:34,254 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 13:22:34,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:22:34,255 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 48 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:34,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 178 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:22:34,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 13:22:34,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-04-27 13:22:34,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:34,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 103 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 13:22:34,284 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 103 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 13:22:34,285 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 103 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 13:22:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:34,288 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2022-04-27 13:22:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2022-04-27 13:22:34,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:34,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:34,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 109 states. [2022-04-27 13:22:34,289 INFO L87 Difference]: Start difference. First operand has 103 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 109 states. [2022-04-27 13:22:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:34,292 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2022-04-27 13:22:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2022-04-27 13:22:34,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:34,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:34,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:34,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 13:22:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2022-04-27 13:22:34,296 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 38 [2022-04-27 13:22:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:34,296 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2022-04-27 13:22:34,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 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-27 13:22:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2022-04-27 13:22:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 13:22:34,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:34,297 INFO L195 NwaCegarLoop]: 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-27 13:22:34,312 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-27 13:22:34,512 WARN L477 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-27 13:22:34,513 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:34,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:34,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-27 13:22:34,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:34,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663717346] [2022-04-27 13:22:34,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:34,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:34,522 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:34,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051233158] [2022-04-27 13:22:34,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:34,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:34,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:34,528 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-27 13:22:34,529 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-27 13:22:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:34,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 13:22:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:34,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:35,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2022-04-27 13:22:35,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {3050#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {3050#true} is VALID [2022-04-27 13:22:35,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:35,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #96#return; {3050#true} is VALID [2022-04-27 13:22:35,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret8 := main(); {3050#true} is VALID [2022-04-27 13:22:35,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {3050#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; {3050#true} is VALID [2022-04-27 13:22:35,292 INFO L272 TraceCheckUtils]: 6: Hoare triple {3050#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:35,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {3050#true} ~cond := #in~cond; {3076#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:22:35,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {3076#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3080#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:22:35,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {3080#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3080#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:22:35,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3080#(not (= |assume_abort_if_not_#in~cond| 0))} {3050#true} #80#return; {3087#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:22:35,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {3087#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:35,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {3091#(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; {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:35,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {3091#(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; {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:35,295 INFO L272 TraceCheckUtils]: 14: Hoare triple {3091#(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)); {3050#true} is VALID [2022-04-27 13:22:35,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:35,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:35,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:35,296 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3050#true} {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:35,296 INFO L272 TraceCheckUtils]: 19: Hoare triple {3091#(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)); {3050#true} is VALID [2022-04-27 13:22:35,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:35,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:35,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:35,297 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3050#true} {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:35,297 INFO L272 TraceCheckUtils]: 24: Hoare triple {3091#(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)); {3050#true} is VALID [2022-04-27 13:22:35,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:35,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:35,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:35,299 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3050#true} {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #86#return; {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:35,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {3091#(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; {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {3146#(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; {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {3146#(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; {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,301 INFO L272 TraceCheckUtils]: 32: Hoare triple {3146#(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)); {3050#true} is VALID [2022-04-27 13:22:35,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:35,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:35,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:35,302 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3050#true} {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,302 INFO L272 TraceCheckUtils]: 37: Hoare triple {3146#(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)); {3050#true} is VALID [2022-04-27 13:22:35,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:35,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:35,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:35,303 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3050#true} {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,303 INFO L272 TraceCheckUtils]: 42: Hoare triple {3146#(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)); {3186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:35,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {3186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:35,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {3190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3051#false} is VALID [2022-04-27 13:22:35,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2022-04-27 13:22:35,304 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-27 13:22:35,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:22:35,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2022-04-27 13:22:35,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {3190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3051#false} is VALID [2022-04-27 13:22:35,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {3186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:35,616 INFO L272 TraceCheckUtils]: 42: Hoare triple {3206#(= 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)); {3186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:35,616 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3050#true} {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #84#return; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:35,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:35,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:35,617 INFO L272 TraceCheckUtils]: 37: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:35,617 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3050#true} {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:35,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:35,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:35,618 INFO L272 TraceCheckUtils]: 32: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:35,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 50);havoc #t~post6; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {3206#(= 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; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,648 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3050#true} {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #86#return; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:35,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:35,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:35,649 INFO L272 TraceCheckUtils]: 24: Hoare triple {3206#(= 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)); {3050#true} is VALID [2022-04-27 13:22:35,649 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3050#true} {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #84#return; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:35,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:35,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:35,650 INFO L272 TraceCheckUtils]: 19: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:35,650 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3050#true} {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:35,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:35,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:35,651 INFO L272 TraceCheckUtils]: 14: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:35,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 50);havoc #t~post6; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {3050#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:35,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3050#true} {3050#true} #80#return; {3050#true} is VALID [2022-04-27 13:22:35,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:35,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:35,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:35,652 INFO L272 TraceCheckUtils]: 6: Hoare triple {3050#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:35,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {3050#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; {3050#true} is VALID [2022-04-27 13:22:35,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret8 := main(); {3050#true} is VALID [2022-04-27 13:22:35,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #96#return; {3050#true} is VALID [2022-04-27 13:22:35,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:35,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {3050#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {3050#true} is VALID [2022-04-27 13:22:35,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2022-04-27 13:22:35,653 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-27 13:22:35,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:35,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663717346] [2022-04-27 13:22:35,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:35,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051233158] [2022-04-27 13:22:35,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051233158] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:22:35,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:22:35,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 13:22:35,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925743306] [2022-04-27 13:22:35,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:35,654 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-27 13:22:35,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:35,654 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-27 13:22:35,684 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-27 13:22:35,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:22:35,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:35,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:22:35,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:22:35,685 INFO L87 Difference]: Start difference. First operand 103 states and 120 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-27 13:22:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:36,004 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2022-04-27 13:22:36,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:22:36,004 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-27 13:22:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:36,004 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-27 13:22:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:22:36,005 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-27 13:22:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:22:36,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 13:22:36,061 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-27 13:22:36,063 INFO L225 Difference]: With dead ends: 120 [2022-04-27 13:22:36,063 INFO L226 Difference]: Without dead ends: 118 [2022-04-27 13:22:36,064 INFO L412 NwaCegarLoop]: 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-27 13:22:36,064 INFO L413 NwaCegarLoop]: 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-27 13:22:36,064 INFO L414 NwaCegarLoop]: 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-27 13:22:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-27 13:22:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2022-04-27 13:22:36,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:36,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 115 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:22:36,094 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 115 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:22:36,094 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 115 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:22:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:36,098 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2022-04-27 13:22:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2022-04-27 13:22:36,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:36,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:36,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 118 states. [2022-04-27 13:22:36,099 INFO L87 Difference]: Start difference. First operand has 115 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 118 states. [2022-04-27 13:22:36,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:36,101 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2022-04-27 13:22:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2022-04-27 13:22:36,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:36,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:36,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:36,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:22:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2022-04-27 13:22:36,104 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 46 [2022-04-27 13:22:36,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:36,105 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2022-04-27 13:22:36,105 INFO L496 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-27 13:22:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2022-04-27 13:22:36,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 13:22:36,105 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:36,106 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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-27 13:22:36,122 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-27 13:22:36,321 WARN L477 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-27 13:22:36,322 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:36,322 INFO L85 PathProgramCache]: Analyzing trace with hash 243046571, now seen corresponding path program 1 times [2022-04-27 13:22:36,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:36,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791993144] [2022-04-27 13:22:36,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:36,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:36,336 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:36,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992797039] [2022-04-27 13:22:36,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:36,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:36,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:36,337 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-27 13:22:36,338 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-27 13:22:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:36,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:22:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:36,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:36,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {3904#true} call ULTIMATE.init(); {3904#true} is VALID [2022-04-27 13:22:36,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {3904#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:36,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {3912#(<= ~counter~0 0)} assume true; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:36,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3912#(<= ~counter~0 0)} {3904#true} #96#return; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:36,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {3912#(<= ~counter~0 0)} call #t~ret8 := main(); {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:36,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {3912#(<= ~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; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:36,576 INFO L272 TraceCheckUtils]: 6: Hoare triple {3912#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:36,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {3912#(<= ~counter~0 0)} ~cond := #in~cond; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:36,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {3912#(<= ~counter~0 0)} assume !(0 == ~cond); {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:36,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {3912#(<= ~counter~0 0)} assume true; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:36,577 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3912#(<= ~counter~0 0)} {3912#(<= ~counter~0 0)} #80#return; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:36,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {3912#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:36,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {3912#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {3946#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,578 INFO L272 TraceCheckUtils]: 14: Hoare triple {3946#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {3946#(<= ~counter~0 1)} ~cond := #in~cond; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {3946#(<= ~counter~0 1)} assume !(0 == ~cond); {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {3946#(<= ~counter~0 1)} assume true; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,580 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3946#(<= ~counter~0 1)} {3946#(<= ~counter~0 1)} #82#return; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,580 INFO L272 TraceCheckUtils]: 19: Hoare triple {3946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {3946#(<= ~counter~0 1)} ~cond := #in~cond; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {3946#(<= ~counter~0 1)} assume !(0 == ~cond); {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {3946#(<= ~counter~0 1)} assume true; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,581 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3946#(<= ~counter~0 1)} {3946#(<= ~counter~0 1)} #84#return; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,582 INFO L272 TraceCheckUtils]: 24: Hoare triple {3946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {3946#(<= ~counter~0 1)} ~cond := #in~cond; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {3946#(<= ~counter~0 1)} assume !(0 == ~cond); {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {3946#(<= ~counter~0 1)} assume true; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,583 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3946#(<= ~counter~0 1)} {3946#(<= ~counter~0 1)} #86#return; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {3946#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:36,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {3946#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {4001#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,584 INFO L272 TraceCheckUtils]: 32: Hoare triple {4001#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {4001#(<= ~counter~0 2)} ~cond := #in~cond; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {4001#(<= ~counter~0 2)} assume !(0 == ~cond); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {4001#(<= ~counter~0 2)} assume true; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,586 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4001#(<= ~counter~0 2)} {4001#(<= ~counter~0 2)} #82#return; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,586 INFO L272 TraceCheckUtils]: 37: Hoare triple {4001#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {4001#(<= ~counter~0 2)} ~cond := #in~cond; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {4001#(<= ~counter~0 2)} assume !(0 == ~cond); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {4001#(<= ~counter~0 2)} assume true; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,587 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4001#(<= ~counter~0 2)} {4001#(<= ~counter~0 2)} #84#return; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,588 INFO L272 TraceCheckUtils]: 42: Hoare triple {4001#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {4001#(<= ~counter~0 2)} ~cond := #in~cond; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {4001#(<= ~counter~0 2)} assume !(0 == ~cond); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {4001#(<= ~counter~0 2)} assume true; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,589 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4001#(<= ~counter~0 2)} {4001#(<= ~counter~0 2)} #86#return; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {4001#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:36,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {4001#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4056#(<= |main_#t~post7| 2)} is VALID [2022-04-27 13:22:36,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {4056#(<= |main_#t~post7| 2)} assume !(#t~post7 < 50);havoc #t~post7; {3905#false} is VALID [2022-04-27 13:22:36,590 INFO L272 TraceCheckUtils]: 50: Hoare triple {3905#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3905#false} is VALID [2022-04-27 13:22:36,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {3905#false} ~cond := #in~cond; {3905#false} is VALID [2022-04-27 13:22:36,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {3905#false} assume 0 == ~cond; {3905#false} is VALID [2022-04-27 13:22:36,590 INFO L290 TraceCheckUtils]: 53: Hoare triple {3905#false} assume !false; {3905#false} is VALID [2022-04-27 13:22:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:22:36,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:22:36,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {3905#false} assume !false; {3905#false} is VALID [2022-04-27 13:22:36,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {3905#false} assume 0 == ~cond; {3905#false} is VALID [2022-04-27 13:22:36,803 INFO L290 TraceCheckUtils]: 51: Hoare triple {3905#false} ~cond := #in~cond; {3905#false} is VALID [2022-04-27 13:22:36,803 INFO L272 TraceCheckUtils]: 50: Hoare triple {3905#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3905#false} is VALID [2022-04-27 13:22:36,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {4084#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {3905#false} is VALID [2022-04-27 13:22:36,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {4088#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4084#(< |main_#t~post7| 50)} is VALID [2022-04-27 13:22:36,804 INFO L290 TraceCheckUtils]: 47: Hoare triple {4088#(< ~counter~0 50)} assume !(~r~0 >= ~d~0); {4088#(< ~counter~0 50)} is VALID [2022-04-27 13:22:36,805 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3904#true} {4088#(< ~counter~0 50)} #86#return; {4088#(< ~counter~0 50)} is VALID [2022-04-27 13:22:36,805 INFO L290 TraceCheckUtils]: 45: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:36,805 INFO L290 TraceCheckUtils]: 44: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:36,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:36,805 INFO L272 TraceCheckUtils]: 42: Hoare triple {4088#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:36,806 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3904#true} {4088#(< ~counter~0 50)} #84#return; {4088#(< ~counter~0 50)} is VALID [2022-04-27 13:22:36,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:36,806 INFO L290 TraceCheckUtils]: 39: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:36,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:36,806 INFO L272 TraceCheckUtils]: 37: Hoare triple {4088#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:36,806 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3904#true} {4088#(< ~counter~0 50)} #82#return; {4088#(< ~counter~0 50)} is VALID [2022-04-27 13:22:36,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:36,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:36,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:36,807 INFO L272 TraceCheckUtils]: 32: Hoare triple {4088#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:36,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {4088#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {4088#(< ~counter~0 50)} is VALID [2022-04-27 13:22:36,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {4143#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4088#(< ~counter~0 50)} is VALID [2022-04-27 13:22:36,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {4143#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4143#(< ~counter~0 49)} is VALID [2022-04-27 13:22:36,808 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3904#true} {4143#(< ~counter~0 49)} #86#return; {4143#(< ~counter~0 49)} is VALID [2022-04-27 13:22:36,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:36,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:36,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:36,809 INFO L272 TraceCheckUtils]: 24: Hoare triple {4143#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:36,809 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3904#true} {4143#(< ~counter~0 49)} #84#return; {4143#(< ~counter~0 49)} is VALID [2022-04-27 13:22:36,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:36,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:36,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:36,809 INFO L272 TraceCheckUtils]: 19: Hoare triple {4143#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:36,810 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3904#true} {4143#(< ~counter~0 49)} #82#return; {4143#(< ~counter~0 49)} is VALID [2022-04-27 13:22:36,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:36,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:36,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:36,810 INFO L272 TraceCheckUtils]: 14: Hoare triple {4143#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:36,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {4143#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {4143#(< ~counter~0 49)} is VALID [2022-04-27 13:22:36,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {4198#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4143#(< ~counter~0 49)} is VALID [2022-04-27 13:22:36,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {4198#(< ~counter~0 48)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {4198#(< ~counter~0 48)} is VALID [2022-04-27 13:22:36,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3904#true} {4198#(< ~counter~0 48)} #80#return; {4198#(< ~counter~0 48)} is VALID [2022-04-27 13:22:36,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:36,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:36,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:36,812 INFO L272 TraceCheckUtils]: 6: Hoare triple {4198#(< ~counter~0 48)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:36,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {4198#(< ~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; {4198#(< ~counter~0 48)} is VALID [2022-04-27 13:22:36,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {4198#(< ~counter~0 48)} call #t~ret8 := main(); {4198#(< ~counter~0 48)} is VALID [2022-04-27 13:22:36,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4198#(< ~counter~0 48)} {3904#true} #96#return; {4198#(< ~counter~0 48)} is VALID [2022-04-27 13:22:36,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {4198#(< ~counter~0 48)} assume true; {4198#(< ~counter~0 48)} is VALID [2022-04-27 13:22:36,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {3904#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {4198#(< ~counter~0 48)} is VALID [2022-04-27 13:22:36,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {3904#true} call ULTIMATE.init(); {3904#true} is VALID [2022-04-27 13:22:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 13:22:36,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:36,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791993144] [2022-04-27 13:22:36,814 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:36,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992797039] [2022-04-27 13:22:36,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992797039] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:22:36,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:22:36,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:22:36,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166235174] [2022-04-27 13:22:36,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:22:36,815 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) Word has length 54 [2022-04-27 13:22:36,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:36,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:22:36,872 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-27 13:22:36,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:22:36,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:36,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:22:36,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:22:36,873 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:22:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:37,491 INFO L93 Difference]: Finished difference Result 207 states and 246 transitions. [2022-04-27 13:22:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 13:22:37,491 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) Word has length 54 [2022-04-27 13:22:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:22:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 167 transitions. [2022-04-27 13:22:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:22:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 167 transitions. [2022-04-27 13:22:37,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 167 transitions. [2022-04-27 13:22:37,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:37,616 INFO L225 Difference]: With dead ends: 207 [2022-04-27 13:22:37,617 INFO L226 Difference]: Without dead ends: 193 [2022-04-27 13:22:37,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:22:37,617 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 91 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:37,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 291 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 13:22:37,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-27 13:22:37,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 186. [2022-04-27 13:22:37,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:37,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 186 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 125 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:22:37,668 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 186 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 125 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:22:37,668 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 186 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 125 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:22:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:37,671 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2022-04-27 13:22:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 224 transitions. [2022-04-27 13:22:37,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:37,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:37,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 125 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) Second operand 193 states. [2022-04-27 13:22:37,672 INFO L87 Difference]: Start difference. First operand has 186 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 125 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) Second operand 193 states. [2022-04-27 13:22:37,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:37,676 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2022-04-27 13:22:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 224 transitions. [2022-04-27 13:22:37,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:37,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:37,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:37,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 125 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:22:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2022-04-27 13:22:37,680 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 54 [2022-04-27 13:22:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:37,680 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2022-04-27 13:22:37,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:22:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2022-04-27 13:22:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 13:22:37,681 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:37,681 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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-27 13:22:37,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 13:22:37,896 WARN L477 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-27 13:22:37,896 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:37,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:37,897 INFO L85 PathProgramCache]: Analyzing trace with hash 244774449, now seen corresponding path program 1 times [2022-04-27 13:22:37,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:37,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455121436] [2022-04-27 13:22:37,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:37,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:37,909 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:37,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [254470894] [2022-04-27 13:22:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:37,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:37,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:37,918 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-27 13:22:37,921 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-27 13:22:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:37,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 13:22:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:37,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:42,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {5177#true} call ULTIMATE.init(); {5177#true} is VALID [2022-04-27 13:22:42,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {5177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {5177#true} is VALID [2022-04-27 13:22:42,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:42,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5177#true} {5177#true} #96#return; {5177#true} is VALID [2022-04-27 13:22:42,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {5177#true} call #t~ret8 := main(); {5177#true} is VALID [2022-04-27 13:22:42,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {5177#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; {5177#true} is VALID [2022-04-27 13:22:42,388 INFO L272 TraceCheckUtils]: 6: Hoare triple {5177#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:42,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:42,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:42,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:42,388 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5177#true} {5177#true} #80#return; {5177#true} is VALID [2022-04-27 13:22:42,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {5177#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:42,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:42,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:42,390 INFO L272 TraceCheckUtils]: 14: Hoare triple {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:42,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:42,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:42,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:42,390 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5177#true} {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #82#return; {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:42,390 INFO L272 TraceCheckUtils]: 19: Hoare triple {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:42,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:42,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:42,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:42,391 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5177#true} {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #84#return; {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:42,391 INFO L272 TraceCheckUtils]: 24: Hoare triple {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:42,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:42,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:42,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:42,392 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5177#true} {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #86#return; {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:42,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:42,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:42,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:42,394 INFO L272 TraceCheckUtils]: 32: Hoare triple {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:42,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:42,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:42,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:42,395 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5177#true} {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #82#return; {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:42,395 INFO L272 TraceCheckUtils]: 37: Hoare triple {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= 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)); {5177#true} is VALID [2022-04-27 13:22:42,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:42,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:42,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:42,396 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5177#true} {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #84#return; {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:42,396 INFO L272 TraceCheckUtils]: 42: Hoare triple {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= 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)); {5177#true} is VALID [2022-04-27 13:22:42,396 INFO L290 TraceCheckUtils]: 43: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:42,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:42,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:42,396 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5177#true} {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #86#return; {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:42,397 INFO L290 TraceCheckUtils]: 47: Hoare triple {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} assume !(~r~0 >= ~d~0); {5325#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (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_~q~0 0))} is VALID [2022-04-27 13:22:42,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {5325#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (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_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5325#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (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_~q~0 0))} is VALID [2022-04-27 13:22:42,398 INFO L290 TraceCheckUtils]: 49: Hoare triple {5325#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (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_~q~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {5325#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (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_~q~0 0))} is VALID [2022-04-27 13:22:42,399 INFO L272 TraceCheckUtils]: 50: Hoare triple {5325#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (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_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {5335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:42,399 INFO L290 TraceCheckUtils]: 51: Hoare triple {5335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:42,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {5339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5178#false} is VALID [2022-04-27 13:22:42,399 INFO L290 TraceCheckUtils]: 53: Hoare triple {5178#false} assume !false; {5178#false} is VALID [2022-04-27 13:22:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 13:22:42,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:22:43,344 INFO L290 TraceCheckUtils]: 53: Hoare triple {5178#false} assume !false; {5178#false} is VALID [2022-04-27 13:22:43,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {5339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5178#false} is VALID [2022-04-27 13:22:43,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {5335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:43,346 INFO L272 TraceCheckUtils]: 50: Hoare triple {5355#(= (+ 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)); {5335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:43,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {5355#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !!(#t~post7 < 50);havoc #t~post7; {5355#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:22:43,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {5355#(= (+ 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; {5355#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:22:43,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {5365#(or (= (+ 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); {5355#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:22:43,347 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5177#true} {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} #86#return; {5365#(or (= (+ 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-27 13:22:43,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:43,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:43,347 INFO L290 TraceCheckUtils]: 43: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:43,347 INFO L272 TraceCheckUtils]: 42: Hoare triple {5365#(or (= (+ 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)); {5177#true} is VALID [2022-04-27 13:22:43,348 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5177#true} {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} #84#return; {5365#(or (= (+ 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-27 13:22:43,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:43,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:43,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:43,348 INFO L272 TraceCheckUtils]: 37: Hoare triple {5365#(or (= (+ 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)); {5177#true} is VALID [2022-04-27 13:22:43,349 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5177#true} {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} #82#return; {5365#(or (= (+ 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-27 13:22:43,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:43,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:43,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:43,349 INFO L272 TraceCheckUtils]: 32: Hoare triple {5365#(or (= (+ 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)); {5177#true} is VALID [2022-04-27 13:22:43,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {5365#(or (= (+ 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; {5365#(or (= (+ 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-27 13:22:43,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {5365#(or (= (+ 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; {5365#(or (= (+ 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-27 13:22:43,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {5420#(or (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; {5365#(or (= (+ 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-27 13:22:43,351 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5177#true} {5420#(or (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; {5420#(or (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-27 13:22:43,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:43,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:43,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:43,351 INFO L272 TraceCheckUtils]: 24: Hoare triple {5420#(or (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)); {5177#true} is VALID [2022-04-27 13:22:43,352 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5177#true} {5420#(or (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; {5420#(or (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-27 13:22:43,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:43,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:43,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:43,352 INFO L272 TraceCheckUtils]: 19: Hoare triple {5420#(or (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)); {5177#true} is VALID [2022-04-27 13:22:43,353 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5177#true} {5420#(or (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; {5420#(or (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-27 13:22:43,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:43,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:43,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:43,353 INFO L272 TraceCheckUtils]: 14: Hoare triple {5420#(or (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)); {5177#true} is VALID [2022-04-27 13:22:43,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {5420#(or (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; {5420#(or (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-27 13:22:43,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {5420#(or (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; {5420#(or (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-27 13:22:43,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {5177#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {5420#(or (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-27 13:22:43,355 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5177#true} {5177#true} #80#return; {5177#true} is VALID [2022-04-27 13:22:43,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:43,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:43,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:43,355 INFO L272 TraceCheckUtils]: 6: Hoare triple {5177#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:43,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {5177#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; {5177#true} is VALID [2022-04-27 13:22:43,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {5177#true} call #t~ret8 := main(); {5177#true} is VALID [2022-04-27 13:22:43,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5177#true} {5177#true} #96#return; {5177#true} is VALID [2022-04-27 13:22:43,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:43,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {5177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {5177#true} is VALID [2022-04-27 13:22:43,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {5177#true} call ULTIMATE.init(); {5177#true} is VALID [2022-04-27 13:22:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 13:22:43,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:43,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455121436] [2022-04-27 13:22:43,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:43,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254470894] [2022-04-27 13:22:43,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254470894] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:22:43,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:22:43,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 13:22:43,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703643451] [2022-04-27 13:22:43,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:22:43,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 54 [2022-04-27 13:22:43,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:43,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:22:43,412 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-27 13:22:43,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:22:43,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:43,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:22:43,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:22:43,413 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:22:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:46,310 INFO L93 Difference]: Finished difference Result 268 states and 340 transitions. [2022-04-27 13:22:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:22:46,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 54 [2022-04-27 13:22:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:22:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-27 13:22:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:22:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-27 13:22:46,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-27 13:22:46,465 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-27 13:22:46,470 INFO L225 Difference]: With dead ends: 268 [2022-04-27 13:22:46,470 INFO L226 Difference]: Without dead ends: 264 [2022-04-27 13:22:46,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:22:46,471 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 53 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:46,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 213 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 13:22:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-27 13:22:46,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 239. [2022-04-27 13:22:46,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:46,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 239 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 163 states have internal predecessors, (189), 56 states have call successors, (56), 29 states have call predecessors, (56), 27 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:22:46,575 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 239 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 163 states have internal predecessors, (189), 56 states have call successors, (56), 29 states have call predecessors, (56), 27 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:22:46,575 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 239 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 163 states have internal predecessors, (189), 56 states have call successors, (56), 29 states have call predecessors, (56), 27 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:22:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:46,580 INFO L93 Difference]: Finished difference Result 264 states and 333 transitions. [2022-04-27 13:22:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 333 transitions. [2022-04-27 13:22:46,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:46,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:46,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 163 states have internal predecessors, (189), 56 states have call successors, (56), 29 states have call predecessors, (56), 27 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) Second operand 264 states. [2022-04-27 13:22:46,581 INFO L87 Difference]: Start difference. First operand has 239 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 163 states have internal predecessors, (189), 56 states have call successors, (56), 29 states have call predecessors, (56), 27 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) Second operand 264 states. [2022-04-27 13:22:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:46,586 INFO L93 Difference]: Finished difference Result 264 states and 333 transitions. [2022-04-27 13:22:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 333 transitions. [2022-04-27 13:22:46,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:46,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:46,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:46,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 163 states have internal predecessors, (189), 56 states have call successors, (56), 29 states have call predecessors, (56), 27 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:22:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 296 transitions. [2022-04-27 13:22:46,592 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 296 transitions. Word has length 54 [2022-04-27 13:22:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:46,592 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 296 transitions. [2022-04-27 13:22:46,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:22:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 296 transitions. [2022-04-27 13:22:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 13:22:46,593 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:46,593 INFO L195 NwaCegarLoop]: 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-27 13:22:46,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 13:22:46,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 13:22:46,807 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:46,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:46,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1142595933, now seen corresponding path program 1 times [2022-04-27 13:22:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:46,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672254022] [2022-04-27 13:22:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:46,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:46,823 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:46,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362191141] [2022-04-27 13:22:46,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:46,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:46,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:46,824 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-27 13:22:46,847 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-27 13:22:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:46,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 13:22:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:46,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:55,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {6750#true} call ULTIMATE.init(); {6750#true} is VALID [2022-04-27 13:22:55,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {6750#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {6750#true} is VALID [2022-04-27 13:22:55,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:55,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6750#true} {6750#true} #96#return; {6750#true} is VALID [2022-04-27 13:22:55,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {6750#true} call #t~ret8 := main(); {6750#true} is VALID [2022-04-27 13:22:55,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {6750#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; {6750#true} is VALID [2022-04-27 13:22:55,859 INFO L272 TraceCheckUtils]: 6: Hoare triple {6750#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:55,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:55,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:55,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:55,860 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6750#true} {6750#true} #80#return; {6750#true} is VALID [2022-04-27 13:22:55,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {6750#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {6788#(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-27 13:22:55,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {6788#(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; {6788#(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-27 13:22:55,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {6788#(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; {6788#(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-27 13:22:55,861 INFO L272 TraceCheckUtils]: 14: Hoare triple {6788#(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)); {6750#true} is VALID [2022-04-27 13:22:55,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:55,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:55,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:55,861 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6750#true} {6788#(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; {6788#(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-27 13:22:55,862 INFO L272 TraceCheckUtils]: 19: Hoare triple {6788#(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)); {6750#true} is VALID [2022-04-27 13:22:55,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:55,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:55,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:55,862 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6750#true} {6788#(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; {6788#(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-27 13:22:55,862 INFO L272 TraceCheckUtils]: 24: Hoare triple {6788#(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)); {6750#true} is VALID [2022-04-27 13:22:55,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:55,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:55,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:55,863 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6750#true} {6788#(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; {6788#(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-27 13:22:55,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {6788#(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; {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:55,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:55,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:55,865 INFO L272 TraceCheckUtils]: 32: Hoare triple {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:55,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:55,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:55,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:55,866 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6750#true} {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #82#return; {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:55,866 INFO L272 TraceCheckUtils]: 37: Hoare triple {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:55,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:55,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:55,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:55,867 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6750#true} {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #84#return; {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:55,867 INFO L272 TraceCheckUtils]: 42: Hoare triple {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:55,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:55,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:55,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:55,867 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6750#true} {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #86#return; {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:55,868 INFO L290 TraceCheckUtils]: 47: Hoare triple {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !(~r~0 >= ~d~0); {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:55,868 INFO L290 TraceCheckUtils]: 48: Hoare triple {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:55,869 INFO L290 TraceCheckUtils]: 49: Hoare triple {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:55,869 INFO L272 TraceCheckUtils]: 50: Hoare triple {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (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)); {6750#true} is VALID [2022-04-27 13:22:55,869 INFO L290 TraceCheckUtils]: 51: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:55,869 INFO L290 TraceCheckUtils]: 52: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:55,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:55,870 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6750#true} {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #88#return; {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:55,870 INFO L272 TraceCheckUtils]: 55: Hoare triple {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:55,870 INFO L290 TraceCheckUtils]: 56: Hoare triple {6750#true} ~cond := #in~cond; {6926#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:55,870 INFO L290 TraceCheckUtils]: 57: Hoare triple {6926#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:22:55,871 INFO L290 TraceCheckUtils]: 58: Hoare triple {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:22:55,872 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #90#return; {6937#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:55,873 INFO L290 TraceCheckUtils]: 60: Hoare triple {6937#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (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); {6941#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (* 2 (mod main_~B~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0) (= main_~p~0 1))} is VALID [2022-04-27 13:22:55,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {6941#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (* 2 (mod main_~B~0 4294967296))) (= main_~q~0 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; {6945#(and (<= (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) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-27 13:22:55,874 INFO L290 TraceCheckUtils]: 62: Hoare triple {6945#(and (<= (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) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6945#(and (<= (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) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-27 13:22:55,875 INFO L290 TraceCheckUtils]: 63: Hoare triple {6945#(and (<= (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) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} assume !!(#t~post7 < 50);havoc #t~post7; {6945#(and (<= (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) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-27 13:22:55,875 INFO L272 TraceCheckUtils]: 64: Hoare triple {6945#(and (<= (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) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6955#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:55,876 INFO L290 TraceCheckUtils]: 65: Hoare triple {6955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:55,876 INFO L290 TraceCheckUtils]: 66: Hoare triple {6959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6751#false} is VALID [2022-04-27 13:22:55,876 INFO L290 TraceCheckUtils]: 67: Hoare triple {6751#false} assume !false; {6751#false} is VALID [2022-04-27 13:22:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-27 13:22:55,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:23:35,538 WARN L232 SmtUtils]: Spent 18.97s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:25:14,276 WARN L232 SmtUtils]: Spent 23.96s 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-27 13:26:26,974 INFO L290 TraceCheckUtils]: 67: Hoare triple {6751#false} assume !false; {6751#false} is VALID [2022-04-27 13:26:26,975 INFO L290 TraceCheckUtils]: 66: Hoare triple {6959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6751#false} is VALID [2022-04-27 13:26:26,975 INFO L290 TraceCheckUtils]: 65: Hoare triple {6955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:26:26,975 INFO L272 TraceCheckUtils]: 64: Hoare triple {6975#(= (+ 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)); {6955#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:26:26,976 INFO L290 TraceCheckUtils]: 63: Hoare triple {6975#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !!(#t~post7 < 50);havoc #t~post7; {6975#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:26:26,976 INFO L290 TraceCheckUtils]: 62: Hoare triple {6975#(= (+ 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; {6975#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:26:26,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {6985#(= (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; {6975#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:26:26,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {6989#(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); {6985#(= (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-27 13:26:26,992 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #90#return; {6989#(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-27 13:26:26,992 INFO L290 TraceCheckUtils]: 58: Hoare triple {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:26:26,992 INFO L290 TraceCheckUtils]: 57: Hoare triple {7003#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:26:26,993 INFO L290 TraceCheckUtils]: 56: Hoare triple {6750#true} ~cond := #in~cond; {7003#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:26:26,993 INFO L272 TraceCheckUtils]: 55: Hoare triple {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (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)); {6750#true} is VALID [2022-04-27 13:26:26,993 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6750#true} {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #88#return; {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 13:26:26,993 INFO L290 TraceCheckUtils]: 53: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:26,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:26,993 INFO L290 TraceCheckUtils]: 51: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:26,993 INFO L272 TraceCheckUtils]: 50: Hoare triple {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= 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)); {6750#true} is VALID [2022-04-27 13:26:26,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} assume !!(#t~post7 < 50);havoc #t~post7; {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 13:26:26,996 INFO L290 TraceCheckUtils]: 48: Hoare triple {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 13:26:26,997 INFO L290 TraceCheckUtils]: 47: Hoare triple {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 13:26:26,997 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6750#true} {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} #86#return; {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:26:26,997 INFO L290 TraceCheckUtils]: 45: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:26,998 INFO L290 TraceCheckUtils]: 44: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:26,998 INFO L290 TraceCheckUtils]: 43: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:26,998 INFO L272 TraceCheckUtils]: 42: Hoare triple {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:26,998 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6750#true} {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} #84#return; {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:26:26,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:26,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:26,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:26,998 INFO L272 TraceCheckUtils]: 37: Hoare triple {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:26,999 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6750#true} {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} #82#return; {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:26:26,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:26,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:26,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:26,999 INFO L272 TraceCheckUtils]: 32: Hoare triple {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:27,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:26:27,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:26:27,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (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)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 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 (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))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:26:27,007 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6750#true} {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} #86#return; {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} is VALID [2022-04-27 13:26:27,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:27,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:27,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:27,007 INFO L272 TraceCheckUtils]: 24: Hoare triple {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:27,008 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6750#true} {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} #84#return; {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} is VALID [2022-04-27 13:26:27,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:27,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:27,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:27,008 INFO L272 TraceCheckUtils]: 19: Hoare triple {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:27,008 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6750#true} {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} #82#return; {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} is VALID [2022-04-27 13:26:27,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:27,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:27,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:27,009 INFO L272 TraceCheckUtils]: 14: Hoare triple {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:27,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} is VALID [2022-04-27 13:26:27,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} is VALID [2022-04-27 13:26:27,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {6750#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} is VALID [2022-04-27 13:26:27,011 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6750#true} {6750#true} #80#return; {6750#true} is VALID [2022-04-27 13:26:27,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:27,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:27,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:27,011 INFO L272 TraceCheckUtils]: 6: Hoare triple {6750#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:27,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {6750#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; {6750#true} is VALID [2022-04-27 13:26:27,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {6750#true} call #t~ret8 := main(); {6750#true} is VALID [2022-04-27 13:26:27,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6750#true} {6750#true} #96#return; {6750#true} is VALID [2022-04-27 13:26:27,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:27,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {6750#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {6750#true} is VALID [2022-04-27 13:26:27,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {6750#true} call ULTIMATE.init(); {6750#true} is VALID [2022-04-27 13:26:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-27 13:26:27,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:26:27,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672254022] [2022-04-27 13:26:27,012 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:26:27,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362191141] [2022-04-27 13:26:27,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362191141] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:26:27,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:26:27,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-27 13:26:27,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739594186] [2022-04-27 13:26:27,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:26:27,013 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) Word has length 68 [2022-04-27 13:26:27,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:26:27,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 13:26:27,119 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-27 13:26:27,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 13:26:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:26:27,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 13:26:27,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-04-27 13:26:27,121 INFO L87 Difference]: Start difference. First operand 239 states and 296 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 13:26:31,770 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-27 13:26:34,004 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-27 13:26:58,649 WARN L232 SmtUtils]: Spent 13.86s on a formula simplification. DAG size of input: 57 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:27:31,369 WARN L232 SmtUtils]: Spent 17.89s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:27:33,782 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-27 13:27:41,079 WARN L232 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 58 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:27:50,438 WARN L232 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 63 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:27:59,472 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-27 13:28:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:28:00,391 INFO L93 Difference]: Finished difference Result 368 states and 470 transitions. [2022-04-27 13:28:00,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 13:28:00,391 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) Word has length 68 [2022-04-27 13:28:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:28:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 13:28:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 163 transitions. [2022-04-27 13:28:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 13:28:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 163 transitions. [2022-04-27 13:28:00,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 163 transitions. [2022-04-27 13:28:00,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:28:00,970 INFO L225 Difference]: With dead ends: 368 [2022-04-27 13:28:00,970 INFO L226 Difference]: Without dead ends: 292 [2022-04-27 13:28:00,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 91.4s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2022-04-27 13:28:00,971 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 107 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 159 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:28:00,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 213 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 469 Invalid, 4 Unknown, 0 Unchecked, 18.1s Time] [2022-04-27 13:28:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-27 13:28:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2022-04-27 13:28:01,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:28:01,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states. Second operand has 252 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 176 states have internal predecessors, (200), 53 states have call successors, (53), 31 states have call predecessors, (53), 30 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 13:28:01,082 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand has 252 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 176 states have internal predecessors, (200), 53 states have call successors, (53), 31 states have call predecessors, (53), 30 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 13:28:01,082 INFO L87 Difference]: Start difference. First operand 292 states. Second operand has 252 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 176 states have internal predecessors, (200), 53 states have call successors, (53), 31 states have call predecessors, (53), 30 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 13:28:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:28:01,089 INFO L93 Difference]: Finished difference Result 292 states and 366 transitions. [2022-04-27 13:28:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 366 transitions. [2022-04-27 13:28:01,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:28:01,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:28:01,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 176 states have internal predecessors, (200), 53 states have call successors, (53), 31 states have call predecessors, (53), 30 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) Second operand 292 states. [2022-04-27 13:28:01,090 INFO L87 Difference]: Start difference. First operand has 252 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 176 states have internal predecessors, (200), 53 states have call successors, (53), 31 states have call predecessors, (53), 30 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) Second operand 292 states. [2022-04-27 13:28:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:28:01,096 INFO L93 Difference]: Finished difference Result 292 states and 366 transitions. [2022-04-27 13:28:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 366 transitions. [2022-04-27 13:28:01,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:28:01,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:28:01,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:28:01,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:28:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 176 states have internal predecessors, (200), 53 states have call successors, (53), 31 states have call predecessors, (53), 30 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 13:28:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 302 transitions. [2022-04-27 13:28:01,102 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 302 transitions. Word has length 68 [2022-04-27 13:28:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:28:01,102 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 302 transitions. [2022-04-27 13:28:01,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 13:28:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 302 transitions. [2022-04-27 13:28:01,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-27 13:28:01,104 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:28:01,104 INFO L195 NwaCegarLoop]: 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-27 13:28:01,122 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-27 13:28:01,310 WARN L477 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-27 13:28:01,311 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:28:01,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:28:01,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1792978632, now seen corresponding path program 1 times [2022-04-27 13:28:01,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:28:01,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467647876] [2022-04-27 13:28:01,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:28:01,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:28:01,320 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:28:01,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604617955] [2022-04-27 13:28:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:28:01,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:28:01,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:28:01,321 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-27 13:28:01,322 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-27 13:28:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:28:01,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 13:28:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:28:01,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:28:05,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {8634#true} call ULTIMATE.init(); {8634#true} is VALID [2022-04-27 13:28:05,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {8634#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {8634#true} is VALID [2022-04-27 13:28:05,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {8634#true} assume true; {8634#true} is VALID [2022-04-27 13:28:05,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8634#true} {8634#true} #96#return; {8634#true} is VALID [2022-04-27 13:28:05,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {8634#true} call #t~ret8 := main(); {8634#true} is VALID [2022-04-27 13:28:05,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {8634#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; {8634#true} is VALID [2022-04-27 13:28:05,116 INFO L272 TraceCheckUtils]: 6: Hoare triple {8634#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {8634#true} is VALID [2022-04-27 13:28:05,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {8634#true} ~cond := #in~cond; {8634#true} is VALID [2022-04-27 13:28:05,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {8634#true} assume !(0 == ~cond); {8634#true} is VALID [2022-04-27 13:28:05,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {8634#true} assume true; {8634#true} is VALID [2022-04-27 13:28:05,116 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8634#true} {8634#true} #80#return; {8634#true} is VALID [2022-04-27 13:28:05,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {8634#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {8672#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:28:05,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {8672#(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; {8672#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:28:05,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {8672#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {8672#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:28:05,118 INFO L272 TraceCheckUtils]: 14: Hoare triple {8672#(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)); {8634#true} is VALID [2022-04-27 13:28:05,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {8634#true} ~cond := #in~cond; {8634#true} is VALID [2022-04-27 13:28:05,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {8634#true} assume !(0 == ~cond); {8634#true} is VALID [2022-04-27 13:28:05,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {8634#true} assume true; {8634#true} is VALID [2022-04-27 13:28:05,118 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8634#true} {8672#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {8672#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:28:05,118 INFO L272 TraceCheckUtils]: 19: Hoare triple {8672#(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)); {8634#true} is VALID [2022-04-27 13:28:05,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {8634#true} ~cond := #in~cond; {8634#true} is VALID [2022-04-27 13:28:05,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {8634#true} assume !(0 == ~cond); {8634#true} is VALID [2022-04-27 13:28:05,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {8634#true} assume true; {8634#true} is VALID [2022-04-27 13:28:05,119 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8634#true} {8672#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {8672#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:28:05,119 INFO L272 TraceCheckUtils]: 24: Hoare triple {8672#(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)); {8634#true} is VALID [2022-04-27 13:28:05,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {8634#true} ~cond := #in~cond; {8715#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:28:05,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {8715#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8719#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:28:05,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {8719#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8719#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:28:05,121 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8719#(not (= |__VERIFIER_assert_#in~cond| 0))} {8672#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {8726#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0))} is VALID [2022-04-27 13:28:05,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {8726#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:28:05,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:28:05,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:28:05,123 INFO L272 TraceCheckUtils]: 32: Hoare triple {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8634#true} is VALID [2022-04-27 13:28:05,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {8634#true} ~cond := #in~cond; {8634#true} is VALID [2022-04-27 13:28:05,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {8634#true} assume !(0 == ~cond); {8634#true} is VALID [2022-04-27 13:28:05,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {8634#true} assume true; {8634#true} is VALID [2022-04-27 13:28:05,124 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8634#true} {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #82#return; {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:28:05,124 INFO L272 TraceCheckUtils]: 37: Hoare triple {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8634#true} is VALID [2022-04-27 13:28:05,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {8634#true} ~cond := #in~cond; {8634#true} is VALID [2022-04-27 13:28:05,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {8634#true} assume !(0 == ~cond); {8634#true} is VALID [2022-04-27 13:28:05,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {8634#true} assume true; {8634#true} is VALID [2022-04-27 13:28:05,124 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8634#true} {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #84#return; {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:28:05,125 INFO L272 TraceCheckUtils]: 42: Hoare triple {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8634#true} is VALID [2022-04-27 13:28:05,125 INFO L290 TraceCheckUtils]: 43: Hoare triple {8634#true} ~cond := #in~cond; {8634#true} is VALID [2022-04-27 13:28:05,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {8634#true} assume !(0 == ~cond); {8634#true} is VALID [2022-04-27 13:28:05,125 INFO L290 TraceCheckUtils]: 45: Hoare triple {8634#true} assume true; {8634#true} is VALID [2022-04-27 13:28:05,125 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8634#true} {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #86#return; {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:28:05,126 INFO L290 TraceCheckUtils]: 47: Hoare triple {8730#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !(~r~0 >= ~d~0); {8785#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:28:05,126 INFO L290 TraceCheckUtils]: 48: Hoare triple {8785#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8785#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:28:05,126 INFO L290 TraceCheckUtils]: 49: Hoare triple {8785#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {8785#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:28:05,127 INFO L272 TraceCheckUtils]: 50: Hoare triple {8785#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (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)); {8634#true} is VALID [2022-04-27 13:28:05,127 INFO L290 TraceCheckUtils]: 51: Hoare triple {8634#true} ~cond := #in~cond; {8634#true} is VALID [2022-04-27 13:28:05,127 INFO L290 TraceCheckUtils]: 52: Hoare triple {8634#true} assume !(0 == ~cond); {8634#true} is VALID [2022-04-27 13:28:05,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {8634#true} assume true; {8634#true} is VALID [2022-04-27 13:28:05,127 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8634#true} {8785#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #88#return; {8785#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:28:05,127 INFO L272 TraceCheckUtils]: 55: Hoare triple {8785#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8634#true} is VALID [2022-04-27 13:28:05,127 INFO L290 TraceCheckUtils]: 56: Hoare triple {8634#true} ~cond := #in~cond; {8634#true} is VALID [2022-04-27 13:28:05,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {8634#true} assume !(0 == ~cond); {8634#true} is VALID [2022-04-27 13:28:05,128 INFO L290 TraceCheckUtils]: 58: Hoare triple {8634#true} assume true; {8634#true} is VALID [2022-04-27 13:28:05,128 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8634#true} {8785#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #90#return; {8785#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:28:05,129 INFO L290 TraceCheckUtils]: 60: Hoare triple {8785#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (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); {8825#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 0) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:28:05,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {8825#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 0) (<= main_~d~0 main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {8829#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} is VALID [2022-04-27 13:28:05,131 INFO L290 TraceCheckUtils]: 62: Hoare triple {8829#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8829#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} is VALID [2022-04-27 13:28:05,131 INFO L290 TraceCheckUtils]: 63: Hoare triple {8829#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} assume !!(#t~post7 < 50);havoc #t~post7; {8829#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} is VALID [2022-04-27 13:28:05,131 INFO L272 TraceCheckUtils]: 64: Hoare triple {8829#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8634#true} is VALID [2022-04-27 13:28:05,131 INFO L290 TraceCheckUtils]: 65: Hoare triple {8634#true} ~cond := #in~cond; {8634#true} is VALID [2022-04-27 13:28:05,131 INFO L290 TraceCheckUtils]: 66: Hoare triple {8634#true} assume !(0 == ~cond); {8634#true} is VALID [2022-04-27 13:28:05,132 INFO L290 TraceCheckUtils]: 67: Hoare triple {8634#true} assume true; {8634#true} is VALID [2022-04-27 13:28:05,132 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8634#true} {8829#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} #88#return; {8829#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} is VALID [2022-04-27 13:28:05,132 INFO L272 TraceCheckUtils]: 69: Hoare triple {8829#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8634#true} is VALID [2022-04-27 13:28:05,132 INFO L290 TraceCheckUtils]: 70: Hoare triple {8634#true} ~cond := #in~cond; {8634#true} is VALID [2022-04-27 13:28:05,132 INFO L290 TraceCheckUtils]: 71: Hoare triple {8634#true} assume !(0 == ~cond); {8634#true} is VALID [2022-04-27 13:28:05,132 INFO L290 TraceCheckUtils]: 72: Hoare triple {8634#true} assume true; {8634#true} is VALID [2022-04-27 13:28:05,133 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8634#true} {8829#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} #90#return; {8829#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} is VALID [2022-04-27 13:28:05,133 INFO L290 TraceCheckUtils]: 74: Hoare triple {8829#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} assume !(1 != ~p~0); {8869#(and (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 1))} is VALID [2022-04-27 13:28:05,134 INFO L272 TraceCheckUtils]: 75: Hoare triple {8869#(and (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {8873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:28:05,134 INFO L290 TraceCheckUtils]: 76: Hoare triple {8873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:28:05,134 INFO L290 TraceCheckUtils]: 77: Hoare triple {8877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8635#false} is VALID [2022-04-27 13:28:05,135 INFO L290 TraceCheckUtils]: 78: Hoare triple {8635#false} assume !false; {8635#false} is VALID [2022-04-27 13:28:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 25 proven. 33 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-27 13:28:05,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:29:35,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:29:35,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467647876] [2022-04-27 13:29:35,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:29:35,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604617955] [2022-04-27 13:29:35,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604617955] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:29:35,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:29:35,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 13:29:35,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818199529] [2022-04-27 13:29:35,136 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:29:35,136 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 79 [2022-04-27 13:29:35,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:29:35,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 13:29:35,191 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-27 13:29:35,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 13:29:35,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:29:35,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 13:29:35,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-04-27 13:29:35,192 INFO L87 Difference]: Start difference. First operand 252 states and 302 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 13:29:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:39,669 INFO L93 Difference]: Finished difference Result 350 states and 433 transitions. [2022-04-27 13:29:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 13:29:39,669 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 79 [2022-04-27 13:29:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:29:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 13:29:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 137 transitions. [2022-04-27 13:29:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 13:29:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 137 transitions. [2022-04-27 13:29:39,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 137 transitions. [2022-04-27 13:29:39,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:29:39,849 INFO L225 Difference]: With dead ends: 350 [2022-04-27 13:29:39,849 INFO L226 Difference]: Without dead ends: 287 [2022-04-27 13:29:39,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-04-27 13:29:39,850 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 31 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:29:39,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 336 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 13:29:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-27 13:29:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 268. [2022-04-27 13:29:40,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:29:40,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 268 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 186 states have internal predecessors, (210), 57 states have call successors, (57), 34 states have call predecessors, (57), 32 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 13:29:40,036 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 268 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 186 states have internal predecessors, (210), 57 states have call successors, (57), 34 states have call predecessors, (57), 32 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 13:29:40,037 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 268 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 186 states have internal predecessors, (210), 57 states have call successors, (57), 34 states have call predecessors, (57), 32 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 13:29:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:40,042 INFO L93 Difference]: Finished difference Result 287 states and 348 transitions. [2022-04-27 13:29:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 348 transitions. [2022-04-27 13:29:40,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:40,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:40,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 186 states have internal predecessors, (210), 57 states have call successors, (57), 34 states have call predecessors, (57), 32 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) Second operand 287 states. [2022-04-27 13:29:40,044 INFO L87 Difference]: Start difference. First operand has 268 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 186 states have internal predecessors, (210), 57 states have call successors, (57), 34 states have call predecessors, (57), 32 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) Second operand 287 states. [2022-04-27 13:29:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:40,049 INFO L93 Difference]: Finished difference Result 287 states and 348 transitions. [2022-04-27 13:29:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 348 transitions. [2022-04-27 13:29:40,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:40,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:40,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:29:40,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:29:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 186 states have internal predecessors, (210), 57 states have call successors, (57), 34 states have call predecessors, (57), 32 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 13:29:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 320 transitions. [2022-04-27 13:29:40,081 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 320 transitions. Word has length 79 [2022-04-27 13:29:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:29:40,081 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 320 transitions. [2022-04-27 13:29:40,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 13:29:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 320 transitions. [2022-04-27 13:29:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 13:29:40,082 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:29:40,082 INFO L195 NwaCegarLoop]: 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-27 13:29:40,104 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-27 13:29:40,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 13:29:40,295 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:29:40,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:29:40,297 INFO L85 PathProgramCache]: Analyzing trace with hash 437079945, now seen corresponding path program 2 times [2022-04-27 13:29:40,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:29:40,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777294420] [2022-04-27 13:29:40,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:29:40,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:29:40,307 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:29:40,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616462528] [2022-04-27 13:29:40,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:29:40,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:29:40,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:29:40,308 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-27 13:29:40,308 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-27 13:29:40,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:29:40,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:29:40,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:29:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:29:40,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:29:40,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {10478#true} call ULTIMATE.init(); {10478#true} is VALID [2022-04-27 13:29:40,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {10478#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {10478#true} is VALID [2022-04-27 13:29:40,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10478#true} {10478#true} #96#return; {10478#true} is VALID [2022-04-27 13:29:40,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {10478#true} call #t~ret8 := main(); {10478#true} is VALID [2022-04-27 13:29:40,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {10478#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; {10478#true} is VALID [2022-04-27 13:29:40,531 INFO L272 TraceCheckUtils]: 6: Hoare triple {10478#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,531 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10478#true} {10478#true} #80#return; {10478#true} is VALID [2022-04-27 13:29:40,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {10478#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {10516#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {10516#(= main_~p~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,532 INFO L272 TraceCheckUtils]: 14: Hoare triple {10516#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,532 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10478#true} {10516#(= main_~p~0 1)} #82#return; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,532 INFO L272 TraceCheckUtils]: 19: Hoare triple {10516#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,533 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10478#true} {10516#(= main_~p~0 1)} #84#return; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,533 INFO L272 TraceCheckUtils]: 24: Hoare triple {10516#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,533 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10478#true} {10516#(= main_~p~0 1)} #86#return; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {10516#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10571#(= main_~p~0 2)} is VALID [2022-04-27 13:29:40,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {10571#(= main_~p~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10571#(= main_~p~0 2)} is VALID [2022-04-27 13:29:40,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {10571#(= main_~p~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {10571#(= main_~p~0 2)} is VALID [2022-04-27 13:29:40,534 INFO L272 TraceCheckUtils]: 32: Hoare triple {10571#(= main_~p~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,535 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10478#true} {10571#(= main_~p~0 2)} #82#return; {10571#(= main_~p~0 2)} is VALID [2022-04-27 13:29:40,535 INFO L272 TraceCheckUtils]: 37: Hoare triple {10571#(= main_~p~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,535 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10478#true} {10571#(= main_~p~0 2)} #84#return; {10571#(= main_~p~0 2)} is VALID [2022-04-27 13:29:40,536 INFO L272 TraceCheckUtils]: 42: Hoare triple {10571#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,536 INFO L290 TraceCheckUtils]: 43: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,536 INFO L290 TraceCheckUtils]: 44: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,536 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10478#true} {10571#(= main_~p~0 2)} #86#return; {10571#(= main_~p~0 2)} is VALID [2022-04-27 13:29:40,536 INFO L290 TraceCheckUtils]: 47: Hoare triple {10571#(= main_~p~0 2)} assume !(~r~0 >= ~d~0); {10571#(= main_~p~0 2)} is VALID [2022-04-27 13:29:40,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {10571#(= main_~p~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10571#(= main_~p~0 2)} is VALID [2022-04-27 13:29:40,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {10571#(= main_~p~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {10571#(= main_~p~0 2)} is VALID [2022-04-27 13:29:40,537 INFO L272 TraceCheckUtils]: 50: Hoare triple {10571#(= main_~p~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,538 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10478#true} {10571#(= main_~p~0 2)} #88#return; {10571#(= main_~p~0 2)} is VALID [2022-04-27 13:29:40,538 INFO L272 TraceCheckUtils]: 55: Hoare triple {10571#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,538 INFO L290 TraceCheckUtils]: 56: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,538 INFO L290 TraceCheckUtils]: 57: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,538 INFO L290 TraceCheckUtils]: 58: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,538 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10478#true} {10571#(= main_~p~0 2)} #90#return; {10571#(= main_~p~0 2)} is VALID [2022-04-27 13:29:40,539 INFO L290 TraceCheckUtils]: 60: Hoare triple {10571#(= 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); {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,539 INFO L290 TraceCheckUtils]: 61: Hoare triple {10516#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,539 INFO L290 TraceCheckUtils]: 62: Hoare triple {10516#(= main_~p~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,539 INFO L290 TraceCheckUtils]: 63: Hoare triple {10516#(= main_~p~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,539 INFO L272 TraceCheckUtils]: 64: Hoare triple {10516#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,539 INFO L290 TraceCheckUtils]: 65: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,539 INFO L290 TraceCheckUtils]: 66: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,540 INFO L290 TraceCheckUtils]: 67: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,540 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10478#true} {10516#(= main_~p~0 1)} #88#return; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,540 INFO L272 TraceCheckUtils]: 69: Hoare triple {10516#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,540 INFO L290 TraceCheckUtils]: 70: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,540 INFO L290 TraceCheckUtils]: 71: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,540 INFO L290 TraceCheckUtils]: 72: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,541 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10478#true} {10516#(= main_~p~0 1)} #90#return; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,541 INFO L290 TraceCheckUtils]: 74: Hoare triple {10516#(= 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); {10479#false} is VALID [2022-04-27 13:29:40,541 INFO L290 TraceCheckUtils]: 75: Hoare triple {10479#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10479#false} is VALID [2022-04-27 13:29:40,541 INFO L290 TraceCheckUtils]: 76: Hoare triple {10479#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10479#false} is VALID [2022-04-27 13:29:40,541 INFO L290 TraceCheckUtils]: 77: Hoare triple {10479#false} assume !!(#t~post7 < 50);havoc #t~post7; {10479#false} is VALID [2022-04-27 13:29:40,541 INFO L272 TraceCheckUtils]: 78: Hoare triple {10479#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10479#false} is VALID [2022-04-27 13:29:40,541 INFO L290 TraceCheckUtils]: 79: Hoare triple {10479#false} ~cond := #in~cond; {10479#false} is VALID [2022-04-27 13:29:40,541 INFO L290 TraceCheckUtils]: 80: Hoare triple {10479#false} assume 0 == ~cond; {10479#false} is VALID [2022-04-27 13:29:40,541 INFO L290 TraceCheckUtils]: 81: Hoare triple {10479#false} assume !false; {10479#false} is VALID [2022-04-27 13:29:40,541 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-27 13:29:40,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:29:40,785 INFO L290 TraceCheckUtils]: 81: Hoare triple {10479#false} assume !false; {10479#false} is VALID [2022-04-27 13:29:40,785 INFO L290 TraceCheckUtils]: 80: Hoare triple {10479#false} assume 0 == ~cond; {10479#false} is VALID [2022-04-27 13:29:40,785 INFO L290 TraceCheckUtils]: 79: Hoare triple {10479#false} ~cond := #in~cond; {10479#false} is VALID [2022-04-27 13:29:40,786 INFO L272 TraceCheckUtils]: 78: Hoare triple {10479#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10479#false} is VALID [2022-04-27 13:29:40,786 INFO L290 TraceCheckUtils]: 77: Hoare triple {10479#false} assume !!(#t~post7 < 50);havoc #t~post7; {10479#false} is VALID [2022-04-27 13:29:40,786 INFO L290 TraceCheckUtils]: 76: Hoare triple {10479#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10479#false} is VALID [2022-04-27 13:29:40,786 INFO L290 TraceCheckUtils]: 75: Hoare triple {10479#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10479#false} is VALID [2022-04-27 13:29:40,791 INFO L290 TraceCheckUtils]: 74: Hoare triple {10516#(= 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); {10479#false} is VALID [2022-04-27 13:29:40,792 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10478#true} {10516#(= main_~p~0 1)} #90#return; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,792 INFO L290 TraceCheckUtils]: 72: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,792 INFO L290 TraceCheckUtils]: 71: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,792 INFO L290 TraceCheckUtils]: 70: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,792 INFO L272 TraceCheckUtils]: 69: Hoare triple {10516#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,793 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10478#true} {10516#(= main_~p~0 1)} #88#return; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,793 INFO L290 TraceCheckUtils]: 67: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,793 INFO L290 TraceCheckUtils]: 66: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,793 INFO L290 TraceCheckUtils]: 65: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,793 INFO L272 TraceCheckUtils]: 64: Hoare triple {10516#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,793 INFO L290 TraceCheckUtils]: 63: Hoare triple {10516#(= main_~p~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,793 INFO L290 TraceCheckUtils]: 62: Hoare triple {10516#(= main_~p~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,794 INFO L290 TraceCheckUtils]: 61: Hoare triple {10516#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,794 INFO L290 TraceCheckUtils]: 60: Hoare triple {10791#(= (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); {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,795 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10478#true} {10791#(= (div main_~p~0 2) 1)} #90#return; {10791#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:40,795 INFO L290 TraceCheckUtils]: 58: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,795 INFO L290 TraceCheckUtils]: 57: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,795 INFO L290 TraceCheckUtils]: 56: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,795 INFO L272 TraceCheckUtils]: 55: Hoare triple {10791#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,796 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10478#true} {10791#(= (div main_~p~0 2) 1)} #88#return; {10791#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:40,796 INFO L290 TraceCheckUtils]: 53: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,796 INFO L272 TraceCheckUtils]: 50: Hoare triple {10791#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {10791#(= (div main_~p~0 2) 1)} assume !!(#t~post7 < 50);havoc #t~post7; {10791#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:40,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {10791#(= (div main_~p~0 2) 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10791#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:40,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {10791#(= (div main_~p~0 2) 1)} assume !(~r~0 >= ~d~0); {10791#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:40,797 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10478#true} {10791#(= (div main_~p~0 2) 1)} #86#return; {10791#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:40,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,797 INFO L290 TraceCheckUtils]: 44: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,797 INFO L272 TraceCheckUtils]: 42: Hoare triple {10791#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,798 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10478#true} {10791#(= (div main_~p~0 2) 1)} #84#return; {10791#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:40,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,798 INFO L272 TraceCheckUtils]: 37: Hoare triple {10791#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,798 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10478#true} {10791#(= (div main_~p~0 2) 1)} #82#return; {10791#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:40,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,798 INFO L272 TraceCheckUtils]: 32: Hoare triple {10791#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {10791#(= (div main_~p~0 2) 1)} assume !!(#t~post6 < 50);havoc #t~post6; {10791#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:40,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {10791#(= (div main_~p~0 2) 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10791#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:40,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {10516#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10791#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:40,800 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10478#true} {10516#(= main_~p~0 1)} #86#return; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,800 INFO L272 TraceCheckUtils]: 24: Hoare triple {10516#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,800 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10478#true} {10516#(= main_~p~0 1)} #84#return; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,801 INFO L272 TraceCheckUtils]: 19: Hoare triple {10516#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,801 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10478#true} {10516#(= main_~p~0 1)} #82#return; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,801 INFO L272 TraceCheckUtils]: 14: Hoare triple {10516#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {10516#(= main_~p~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {10516#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {10478#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {10516#(= main_~p~0 1)} is VALID [2022-04-27 13:29:40,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10478#true} {10478#true} #80#return; {10478#true} is VALID [2022-04-27 13:29:40,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {10478#true} assume !(0 == ~cond); {10478#true} is VALID [2022-04-27 13:29:40,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {10478#true} ~cond := #in~cond; {10478#true} is VALID [2022-04-27 13:29:40,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {10478#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {10478#true} is VALID [2022-04-27 13:29:40,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {10478#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; {10478#true} is VALID [2022-04-27 13:29:40,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {10478#true} call #t~ret8 := main(); {10478#true} is VALID [2022-04-27 13:29:40,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10478#true} {10478#true} #96#return; {10478#true} is VALID [2022-04-27 13:29:40,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {10478#true} assume true; {10478#true} is VALID [2022-04-27 13:29:40,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {10478#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {10478#true} is VALID [2022-04-27 13:29:40,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {10478#true} call ULTIMATE.init(); {10478#true} is VALID [2022-04-27 13:29:40,803 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-27 13:29:40,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:29:40,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777294420] [2022-04-27 13:29:40,803 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:29:40,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616462528] [2022-04-27 13:29:40,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616462528] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:29:40,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:29:40,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2022-04-27 13:29:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041806657] [2022-04-27 13:29:40,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:29:40,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 82 [2022-04-27 13:29:40,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:29:40,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 13:29:40,861 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-27 13:29:40,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:29:40,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:29:40,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:29:40,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:29:40,862 INFO L87 Difference]: Start difference. First operand 268 states and 320 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 13:29:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:41,250 INFO L93 Difference]: Finished difference Result 306 states and 366 transitions. [2022-04-27 13:29:41,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:29:41,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 82 [2022-04-27 13:29:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:29:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 13:29:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-27 13:29:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 13:29:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-27 13:29:41,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-27 13:29:41,355 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-27 13:29:41,359 INFO L225 Difference]: With dead ends: 306 [2022-04-27 13:29:41,359 INFO L226 Difference]: Without dead ends: 259 [2022-04-27 13:29:41,359 INFO L412 NwaCegarLoop]: 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-27 13:29:41,360 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:29:41,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:29:41,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-27 13:29:41,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 248. [2022-04-27 13:29:41,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:29:41,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 248 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 171 states have internal predecessors, (194), 51 states have call successors, (51), 32 states have call predecessors, (51), 30 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-27 13:29:41,487 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 248 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 171 states have internal predecessors, (194), 51 states have call successors, (51), 32 states have call predecessors, (51), 30 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-27 13:29:41,487 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 248 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 171 states have internal predecessors, (194), 51 states have call successors, (51), 32 states have call predecessors, (51), 30 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-27 13:29:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:41,493 INFO L93 Difference]: Finished difference Result 259 states and 306 transitions. [2022-04-27 13:29:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 306 transitions. [2022-04-27 13:29:41,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:41,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:41,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 248 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 171 states have internal predecessors, (194), 51 states have call successors, (51), 32 states have call predecessors, (51), 30 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) Second operand 259 states. [2022-04-27 13:29:41,495 INFO L87 Difference]: Start difference. First operand has 248 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 171 states have internal predecessors, (194), 51 states have call successors, (51), 32 states have call predecessors, (51), 30 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) Second operand 259 states. [2022-04-27 13:29:41,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:41,501 INFO L93 Difference]: Finished difference Result 259 states and 306 transitions. [2022-04-27 13:29:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 306 transitions. [2022-04-27 13:29:41,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:41,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:41,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:29:41,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:29:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 171 states have internal predecessors, (194), 51 states have call successors, (51), 32 states have call predecessors, (51), 30 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-27 13:29:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 293 transitions. [2022-04-27 13:29:41,506 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 293 transitions. Word has length 82 [2022-04-27 13:29:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:29:41,506 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 293 transitions. [2022-04-27 13:29:41,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 13:29:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 293 transitions. [2022-04-27 13:29:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 13:29:41,507 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:29:41,507 INFO L195 NwaCegarLoop]: 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-27 13:29:41,541 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-27 13:29:41,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 13:29:41,722 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:29:41,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:29:41,722 INFO L85 PathProgramCache]: Analyzing trace with hash 111833757, now seen corresponding path program 1 times [2022-04-27 13:29:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:29:41,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204210827] [2022-04-27 13:29:41,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:29:41,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:29:41,737 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:29:41,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027273730] [2022-04-27 13:29:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:29:41,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:29:41,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:29:41,739 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-27 13:29:41,740 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-27 13:29:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:29:41,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 13:29:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:29:41,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:29:42,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {12245#true} call ULTIMATE.init(); {12245#true} is VALID [2022-04-27 13:29:42,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {12245#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {12245#true} is VALID [2022-04-27 13:29:42,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:42,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12245#true} {12245#true} #96#return; {12245#true} is VALID [2022-04-27 13:29:42,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {12245#true} call #t~ret8 := main(); {12245#true} is VALID [2022-04-27 13:29:42,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {12245#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; {12245#true} is VALID [2022-04-27 13:29:42,511 INFO L272 TraceCheckUtils]: 6: Hoare triple {12245#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {12245#true} is VALID [2022-04-27 13:29:42,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:42,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:42,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:42,511 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12245#true} {12245#true} #80#return; {12245#true} is VALID [2022-04-27 13:29:42,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {12245#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:42,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {12283#(= main_~d~0 (mod main_~B~0 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:42,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {12283#(= main_~d~0 (mod main_~B~0 4294967296))} assume !!(#t~post6 < 50);havoc #t~post6; {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:42,512 INFO L272 TraceCheckUtils]: 14: Hoare triple {12283#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12245#true} is VALID [2022-04-27 13:29:42,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:42,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:42,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:42,512 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12245#true} {12283#(= main_~d~0 (mod main_~B~0 4294967296))} #82#return; {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:42,512 INFO L272 TraceCheckUtils]: 19: Hoare triple {12283#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {12245#true} is VALID [2022-04-27 13:29:42,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:42,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:42,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:42,513 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12245#true} {12283#(= main_~d~0 (mod main_~B~0 4294967296))} #84#return; {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:42,513 INFO L272 TraceCheckUtils]: 24: Hoare triple {12283#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12245#true} is VALID [2022-04-27 13:29:42,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:42,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:42,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:42,513 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12245#true} {12283#(= main_~d~0 (mod main_~B~0 4294967296))} #86#return; {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:42,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {12283#(= main_~d~0 (mod main_~B~0 4294967296))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12338#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 13:29:42,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {12338#(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; {12338#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 13:29:42,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {12338#(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; {12338#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 13:29:42,515 INFO L272 TraceCheckUtils]: 32: Hoare triple {12338#(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)); {12245#true} is VALID [2022-04-27 13:29:42,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:42,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:42,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:42,515 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12245#true} {12338#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} #82#return; {12338#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 13:29:42,515 INFO L272 TraceCheckUtils]: 37: Hoare triple {12338#(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)); {12245#true} is VALID [2022-04-27 13:29:42,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:42,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:42,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:42,531 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12245#true} {12338#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} #84#return; {12338#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 13:29:42,531 INFO L272 TraceCheckUtils]: 42: Hoare triple {12338#(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)); {12245#true} is VALID [2022-04-27 13:29:42,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:42,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:42,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:42,532 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12245#true} {12338#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} #86#return; {12338#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 13:29:42,533 INFO L290 TraceCheckUtils]: 47: Hoare triple {12338#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !(~r~0 >= ~d~0); {12393#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-27 13:29:42,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {12393#(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; {12393#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-27 13:29:42,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {12393#(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; {12393#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-27 13:29:42,533 INFO L272 TraceCheckUtils]: 50: Hoare triple {12393#(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)); {12245#true} is VALID [2022-04-27 13:29:42,534 INFO L290 TraceCheckUtils]: 51: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:42,534 INFO L290 TraceCheckUtils]: 52: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:42,534 INFO L290 TraceCheckUtils]: 53: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:42,534 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12245#true} {12393#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} #88#return; {12393#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-27 13:29:42,534 INFO L272 TraceCheckUtils]: 55: Hoare triple {12393#(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)); {12245#true} is VALID [2022-04-27 13:29:42,534 INFO L290 TraceCheckUtils]: 56: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:42,534 INFO L290 TraceCheckUtils]: 57: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:42,534 INFO L290 TraceCheckUtils]: 58: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:42,535 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12245#true} {12393#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} #90#return; {12393#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-27 13:29:42,536 INFO L290 TraceCheckUtils]: 60: Hoare triple {12393#(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); {12433#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:42,536 INFO L290 TraceCheckUtils]: 61: Hoare triple {12433#(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; {12433#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:42,536 INFO L290 TraceCheckUtils]: 62: Hoare triple {12433#(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; {12433#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:42,537 INFO L290 TraceCheckUtils]: 63: Hoare triple {12433#(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; {12433#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:42,537 INFO L272 TraceCheckUtils]: 64: Hoare triple {12433#(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)); {12245#true} is VALID [2022-04-27 13:29:42,537 INFO L290 TraceCheckUtils]: 65: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:42,537 INFO L290 TraceCheckUtils]: 66: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:42,537 INFO L290 TraceCheckUtils]: 67: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:42,537 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12245#true} {12433#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} #88#return; {12433#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:42,537 INFO L272 TraceCheckUtils]: 69: Hoare triple {12433#(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)); {12245#true} is VALID [2022-04-27 13:29:42,537 INFO L290 TraceCheckUtils]: 70: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:42,537 INFO L290 TraceCheckUtils]: 71: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:42,538 INFO L290 TraceCheckUtils]: 72: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:42,538 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12245#true} {12433#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} #90#return; {12433#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:42,538 INFO L290 TraceCheckUtils]: 74: Hoare triple {12433#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} assume !(1 != ~p~0); {12433#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:42,538 INFO L272 TraceCheckUtils]: 75: Hoare triple {12433#(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)); {12245#true} is VALID [2022-04-27 13:29:42,538 INFO L290 TraceCheckUtils]: 76: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:42,538 INFO L290 TraceCheckUtils]: 77: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:42,538 INFO L290 TraceCheckUtils]: 78: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:42,539 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12245#true} {12433#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} #92#return; {12433#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:42,539 INFO L272 TraceCheckUtils]: 80: Hoare triple {12433#(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)); {12494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:29:42,539 INFO L290 TraceCheckUtils]: 81: Hoare triple {12494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:29:42,540 INFO L290 TraceCheckUtils]: 82: Hoare triple {12498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12246#false} is VALID [2022-04-27 13:29:42,540 INFO L290 TraceCheckUtils]: 83: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-27 13:29:42,540 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-27 13:29:42,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:29:43,021 INFO L290 TraceCheckUtils]: 83: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-27 13:29:43,021 INFO L290 TraceCheckUtils]: 82: Hoare triple {12498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12246#false} is VALID [2022-04-27 13:29:43,022 INFO L290 TraceCheckUtils]: 81: Hoare triple {12494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:29:43,022 INFO L272 TraceCheckUtils]: 80: Hoare triple {12283#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {12494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:29:43,022 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12245#true} {12283#(= main_~d~0 (mod main_~B~0 4294967296))} #92#return; {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:43,022 INFO L290 TraceCheckUtils]: 78: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:43,022 INFO L290 TraceCheckUtils]: 77: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:43,023 INFO L290 TraceCheckUtils]: 76: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:43,023 INFO L272 TraceCheckUtils]: 75: Hoare triple {12283#(= 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)); {12245#true} is VALID [2022-04-27 13:29:43,023 INFO L290 TraceCheckUtils]: 74: Hoare triple {12283#(= main_~d~0 (mod main_~B~0 4294967296))} assume !(1 != ~p~0); {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:43,023 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12245#true} {12283#(= main_~d~0 (mod main_~B~0 4294967296))} #90#return; {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:43,023 INFO L290 TraceCheckUtils]: 72: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:43,023 INFO L290 TraceCheckUtils]: 71: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:43,023 INFO L290 TraceCheckUtils]: 70: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:43,023 INFO L272 TraceCheckUtils]: 69: Hoare triple {12283#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12245#true} is VALID [2022-04-27 13:29:43,024 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12245#true} {12283#(= main_~d~0 (mod main_~B~0 4294967296))} #88#return; {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:43,024 INFO L290 TraceCheckUtils]: 67: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:43,024 INFO L290 TraceCheckUtils]: 66: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:43,024 INFO L290 TraceCheckUtils]: 65: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:43,024 INFO L272 TraceCheckUtils]: 64: Hoare triple {12283#(= 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)); {12245#true} is VALID [2022-04-27 13:29:43,024 INFO L290 TraceCheckUtils]: 63: Hoare triple {12283#(= main_~d~0 (mod main_~B~0 4294967296))} assume !!(#t~post7 < 50);havoc #t~post7; {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:43,024 INFO L290 TraceCheckUtils]: 62: Hoare triple {12283#(= main_~d~0 (mod main_~B~0 4294967296))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:43,024 INFO L290 TraceCheckUtils]: 61: Hoare triple {12283#(= 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; {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:43,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {12574#(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); {12283#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:43,026 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12245#true} {12574#(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; {12574#(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-27 13:29:43,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:43,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:43,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:43,026 INFO L272 TraceCheckUtils]: 55: Hoare triple {12574#(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)); {12245#true} is VALID [2022-04-27 13:29:43,027 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12245#true} {12574#(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; {12574#(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-27 13:29:43,027 INFO L290 TraceCheckUtils]: 53: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:43,027 INFO L290 TraceCheckUtils]: 52: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:43,027 INFO L290 TraceCheckUtils]: 51: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:43,027 INFO L272 TraceCheckUtils]: 50: Hoare triple {12574#(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)); {12245#true} is VALID [2022-04-27 13:29:43,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {12574#(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; {12574#(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-27 13:29:43,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {12574#(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; {12574#(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-27 13:29:43,029 INFO L290 TraceCheckUtils]: 47: Hoare triple {12614#(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); {12574#(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-27 13:29:43,029 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12245#true} {12614#(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; {12614#(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-27 13:29:43,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:43,030 INFO L290 TraceCheckUtils]: 44: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:43,030 INFO L290 TraceCheckUtils]: 43: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:43,030 INFO L272 TraceCheckUtils]: 42: Hoare triple {12614#(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)); {12245#true} is VALID [2022-04-27 13:29:43,030 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12245#true} {12614#(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; {12614#(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-27 13:29:43,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:43,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:43,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:43,030 INFO L272 TraceCheckUtils]: 37: Hoare triple {12614#(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)); {12245#true} is VALID [2022-04-27 13:29:43,031 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12245#true} {12614#(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; {12614#(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-27 13:29:43,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:43,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:43,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:43,031 INFO L272 TraceCheckUtils]: 32: Hoare triple {12614#(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)); {12245#true} is VALID [2022-04-27 13:29:43,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {12614#(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; {12614#(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-27 13:29:43,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {12614#(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; {12614#(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-27 13:29:43,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {12669#(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; {12614#(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-27 13:29:43,033 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12245#true} {12669#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} #86#return; {12669#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-27 13:29:43,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:43,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:43,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:43,033 INFO L272 TraceCheckUtils]: 24: Hoare triple {12669#(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)); {12245#true} is VALID [2022-04-27 13:29:43,034 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12245#true} {12669#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} #84#return; {12669#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-27 13:29:43,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:43,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:43,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:43,034 INFO L272 TraceCheckUtils]: 19: Hoare triple {12669#(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)); {12245#true} is VALID [2022-04-27 13:29:43,034 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12245#true} {12669#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} #82#return; {12669#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-27 13:29:43,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:43,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:43,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:43,034 INFO L272 TraceCheckUtils]: 14: Hoare triple {12669#(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)); {12245#true} is VALID [2022-04-27 13:29:43,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {12669#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {12669#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-27 13:29:43,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {12669#(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; {12669#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-27 13:29:43,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {12245#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {12669#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-27 13:29:43,035 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12245#true} {12245#true} #80#return; {12245#true} is VALID [2022-04-27 13:29:43,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:43,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-27 13:29:43,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-27 13:29:43,036 INFO L272 TraceCheckUtils]: 6: Hoare triple {12245#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {12245#true} is VALID [2022-04-27 13:29:43,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {12245#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; {12245#true} is VALID [2022-04-27 13:29:43,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {12245#true} call #t~ret8 := main(); {12245#true} is VALID [2022-04-27 13:29:43,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12245#true} {12245#true} #96#return; {12245#true} is VALID [2022-04-27 13:29:43,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-27 13:29:43,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {12245#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {12245#true} is VALID [2022-04-27 13:29:43,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {12245#true} call ULTIMATE.init(); {12245#true} is VALID [2022-04-27 13:29:43,036 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-27 13:29:43,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:29:43,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204210827] [2022-04-27 13:29:43,037 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:29:43,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027273730] [2022-04-27 13:29:43,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027273730] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:29:43,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:29:43,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-27 13:29:43,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285704137] [2022-04-27 13:29:43,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:29:43,039 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) Word has length 84 [2022-04-27 13:29:43,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:29:43,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:29:43,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:29:43,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 13:29:43,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:29:43,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 13:29:43,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:29:43,135 INFO L87 Difference]: Start difference. First operand 248 states and 293 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:29:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:44,104 INFO L93 Difference]: Finished difference Result 254 states and 299 transitions. [2022-04-27 13:29:44,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:29:44,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) Word has length 84 [2022-04-27 13:29:44,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:29:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:29:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-04-27 13:29:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:29:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-04-27 13:29:44,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 82 transitions. [2022-04-27 13:29:44,158 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-27 13:29:44,162 INFO L225 Difference]: With dead ends: 254 [2022-04-27 13:29:44,162 INFO L226 Difference]: Without dead ends: 229 [2022-04-27 13:29:44,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:29:44,163 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 12 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:29:44,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 220 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 13:29:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-04-27 13:29:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-04-27 13:29:44,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:29:44,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 229 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 158 states have internal predecessors, (180), 47 states have call successors, (47), 30 states have call predecessors, (47), 28 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:29:44,280 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 229 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 158 states have internal predecessors, (180), 47 states have call successors, (47), 30 states have call predecessors, (47), 28 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:29:44,280 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 229 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 158 states have internal predecessors, (180), 47 states have call successors, (47), 30 states have call predecessors, (47), 28 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:29:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:44,285 INFO L93 Difference]: Finished difference Result 229 states and 271 transitions. [2022-04-27 13:29:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 271 transitions. [2022-04-27 13:29:44,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:44,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:44,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 158 states have internal predecessors, (180), 47 states have call successors, (47), 30 states have call predecessors, (47), 28 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) Second operand 229 states. [2022-04-27 13:29:44,286 INFO L87 Difference]: Start difference. First operand has 229 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 158 states have internal predecessors, (180), 47 states have call successors, (47), 30 states have call predecessors, (47), 28 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) Second operand 229 states. [2022-04-27 13:29:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:44,290 INFO L93 Difference]: Finished difference Result 229 states and 271 transitions. [2022-04-27 13:29:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 271 transitions. [2022-04-27 13:29:44,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:44,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:44,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:29:44,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:29:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 158 states have internal predecessors, (180), 47 states have call successors, (47), 30 states have call predecessors, (47), 28 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:29:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 271 transitions. [2022-04-27 13:29:44,294 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 271 transitions. Word has length 84 [2022-04-27 13:29:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:29:44,295 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 271 transitions. [2022-04-27 13:29:44,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:29:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 271 transitions. [2022-04-27 13:29:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-27 13:29:44,296 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:29:44,296 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 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-27 13:29:44,333 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-27 13:29:44,512 WARN L477 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-27 13:29:44,512 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:29:44,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:29:44,513 INFO L85 PathProgramCache]: Analyzing trace with hash 973212947, now seen corresponding path program 1 times [2022-04-27 13:29:44,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:29:44,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515979611] [2022-04-27 13:29:44,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:29:44,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:29:44,536 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:29:44,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [750462084] [2022-04-27 13:29:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:29:44,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:29:44,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:29:44,548 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-27 13:29:44,549 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-27 13:29:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:29:44,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:29:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:29:44,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:29:45,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {13881#true} call ULTIMATE.init(); {13881#true} is VALID [2022-04-27 13:29:45,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {13881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {13881#true} is VALID [2022-04-27 13:29:45,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-27 13:29:45,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13881#true} {13881#true} #96#return; {13881#true} is VALID [2022-04-27 13:29:45,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {13881#true} call #t~ret8 := main(); {13881#true} is VALID [2022-04-27 13:29:45,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {13881#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; {13881#true} is VALID [2022-04-27 13:29:45,478 INFO L272 TraceCheckUtils]: 6: Hoare triple {13881#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {13881#true} is VALID [2022-04-27 13:29:45,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {13881#true} ~cond := #in~cond; {13881#true} is VALID [2022-04-27 13:29:45,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {13881#true} assume !(0 == ~cond); {13881#true} is VALID [2022-04-27 13:29:45,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-27 13:29:45,478 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13881#true} {13881#true} #80#return; {13881#true} is VALID [2022-04-27 13:29:45,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {13881#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {13919#(<= 1 main_~p~0)} is VALID [2022-04-27 13:29:45,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {13919#(<= 1 main_~p~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13919#(<= 1 main_~p~0)} is VALID [2022-04-27 13:29:45,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {13919#(<= 1 main_~p~0)} assume !!(#t~post6 < 50);havoc #t~post6; {13919#(<= 1 main_~p~0)} is VALID [2022-04-27 13:29:45,479 INFO L272 TraceCheckUtils]: 14: Hoare triple {13919#(<= 1 main_~p~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13881#true} is VALID [2022-04-27 13:29:45,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {13881#true} ~cond := #in~cond; {13881#true} is VALID [2022-04-27 13:29:45,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {13881#true} assume !(0 == ~cond); {13881#true} is VALID [2022-04-27 13:29:45,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-27 13:29:45,479 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13881#true} {13919#(<= 1 main_~p~0)} #82#return; {13919#(<= 1 main_~p~0)} is VALID [2022-04-27 13:29:45,479 INFO L272 TraceCheckUtils]: 19: Hoare triple {13919#(<= 1 main_~p~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13881#true} is VALID [2022-04-27 13:29:45,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {13881#true} ~cond := #in~cond; {13881#true} is VALID [2022-04-27 13:29:45,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {13881#true} assume !(0 == ~cond); {13881#true} is VALID [2022-04-27 13:29:45,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-27 13:29:45,480 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13881#true} {13919#(<= 1 main_~p~0)} #84#return; {13919#(<= 1 main_~p~0)} is VALID [2022-04-27 13:29:45,480 INFO L272 TraceCheckUtils]: 24: Hoare triple {13919#(<= 1 main_~p~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13881#true} is VALID [2022-04-27 13:29:45,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {13881#true} ~cond := #in~cond; {13881#true} is VALID [2022-04-27 13:29:45,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {13881#true} assume !(0 == ~cond); {13881#true} is VALID [2022-04-27 13:29:45,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-27 13:29:45,480 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13881#true} {13919#(<= 1 main_~p~0)} #86#return; {13919#(<= 1 main_~p~0)} is VALID [2022-04-27 13:29:45,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {13919#(<= 1 main_~p~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13974#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:29:45,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {13974#(<= 1 (div main_~p~0 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13974#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:29:45,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {13974#(<= 1 (div main_~p~0 2))} assume !!(#t~post6 < 50);havoc #t~post6; {13974#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:29:45,481 INFO L272 TraceCheckUtils]: 32: Hoare triple {13974#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13881#true} is VALID [2022-04-27 13:29:45,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {13881#true} ~cond := #in~cond; {13881#true} is VALID [2022-04-27 13:29:45,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {13881#true} assume !(0 == ~cond); {13881#true} is VALID [2022-04-27 13:29:45,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-27 13:29:45,482 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13881#true} {13974#(<= 1 (div main_~p~0 2))} #82#return; {13974#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:29:45,482 INFO L272 TraceCheckUtils]: 37: Hoare triple {13974#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13881#true} is VALID [2022-04-27 13:29:45,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {13881#true} ~cond := #in~cond; {13881#true} is VALID [2022-04-27 13:29:45,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {13881#true} assume !(0 == ~cond); {13881#true} is VALID [2022-04-27 13:29:45,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-27 13:29:45,482 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13881#true} {13974#(<= 1 (div main_~p~0 2))} #84#return; {13974#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:29:45,482 INFO L272 TraceCheckUtils]: 42: Hoare triple {13974#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13881#true} is VALID [2022-04-27 13:29:45,482 INFO L290 TraceCheckUtils]: 43: Hoare triple {13881#true} ~cond := #in~cond; {13881#true} is VALID [2022-04-27 13:29:45,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {13881#true} assume !(0 == ~cond); {13881#true} is VALID [2022-04-27 13:29:45,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-27 13:29:45,483 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13881#true} {13974#(<= 1 (div main_~p~0 2))} #86#return; {13974#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:29:45,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {13974#(<= 1 (div main_~p~0 2))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {14029#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:45,484 INFO L290 TraceCheckUtils]: 48: Hoare triple {14029#(<= 1 (div (div main_~p~0 2) 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14029#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:45,484 INFO L290 TraceCheckUtils]: 49: Hoare triple {14029#(<= 1 (div (div main_~p~0 2) 2))} assume !!(#t~post6 < 50);havoc #t~post6; {14029#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:45,484 INFO L272 TraceCheckUtils]: 50: Hoare triple {14029#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13881#true} is VALID [2022-04-27 13:29:45,484 INFO L290 TraceCheckUtils]: 51: Hoare triple {13881#true} ~cond := #in~cond; {13881#true} is VALID [2022-04-27 13:29:45,484 INFO L290 TraceCheckUtils]: 52: Hoare triple {13881#true} assume !(0 == ~cond); {13881#true} is VALID [2022-04-27 13:29:45,484 INFO L290 TraceCheckUtils]: 53: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-27 13:29:45,484 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13881#true} {14029#(<= 1 (div (div main_~p~0 2) 2))} #82#return; {14029#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:45,484 INFO L272 TraceCheckUtils]: 55: Hoare triple {14029#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13881#true} is VALID [2022-04-27 13:29:45,484 INFO L290 TraceCheckUtils]: 56: Hoare triple {13881#true} ~cond := #in~cond; {13881#true} is VALID [2022-04-27 13:29:45,484 INFO L290 TraceCheckUtils]: 57: Hoare triple {13881#true} assume !(0 == ~cond); {13881#true} is VALID [2022-04-27 13:29:45,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-27 13:29:45,489 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13881#true} {14029#(<= 1 (div (div main_~p~0 2) 2))} #84#return; {14029#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:45,489 INFO L272 TraceCheckUtils]: 60: Hoare triple {14029#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13881#true} is VALID [2022-04-27 13:29:45,489 INFO L290 TraceCheckUtils]: 61: Hoare triple {13881#true} ~cond := #in~cond; {13881#true} is VALID [2022-04-27 13:29:45,489 INFO L290 TraceCheckUtils]: 62: Hoare triple {13881#true} assume !(0 == ~cond); {13881#true} is VALID [2022-04-27 13:29:45,489 INFO L290 TraceCheckUtils]: 63: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-27 13:29:45,489 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13881#true} {14029#(<= 1 (div (div main_~p~0 2) 2))} #86#return; {14029#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:45,490 INFO L290 TraceCheckUtils]: 65: Hoare triple {14029#(<= 1 (div (div main_~p~0 2) 2))} assume !(~r~0 >= ~d~0); {14029#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:45,490 INFO L290 TraceCheckUtils]: 66: Hoare triple {14029#(<= 1 (div (div main_~p~0 2) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14029#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:45,490 INFO L290 TraceCheckUtils]: 67: Hoare triple {14029#(<= 1 (div (div main_~p~0 2) 2))} assume !!(#t~post7 < 50);havoc #t~post7; {14029#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:45,490 INFO L272 TraceCheckUtils]: 68: Hoare triple {14029#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {13881#true} is VALID [2022-04-27 13:29:45,490 INFO L290 TraceCheckUtils]: 69: Hoare triple {13881#true} ~cond := #in~cond; {13881#true} is VALID [2022-04-27 13:29:45,490 INFO L290 TraceCheckUtils]: 70: Hoare triple {13881#true} assume !(0 == ~cond); {13881#true} is VALID [2022-04-27 13:29:45,490 INFO L290 TraceCheckUtils]: 71: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-27 13:29:45,491 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13881#true} {14029#(<= 1 (div (div main_~p~0 2) 2))} #88#return; {14029#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:45,491 INFO L272 TraceCheckUtils]: 73: Hoare triple {14029#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13881#true} is VALID [2022-04-27 13:29:45,491 INFO L290 TraceCheckUtils]: 74: Hoare triple {13881#true} ~cond := #in~cond; {13881#true} is VALID [2022-04-27 13:29:45,491 INFO L290 TraceCheckUtils]: 75: Hoare triple {13881#true} assume !(0 == ~cond); {13881#true} is VALID [2022-04-27 13:29:45,491 INFO L290 TraceCheckUtils]: 76: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-27 13:29:45,491 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {13881#true} {14029#(<= 1 (div (div main_~p~0 2) 2))} #90#return; {14029#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:45,491 INFO L290 TraceCheckUtils]: 78: Hoare triple {14029#(<= 1 (div (div main_~p~0 2) 2))} assume !(1 != ~p~0); {13882#false} is VALID [2022-04-27 13:29:45,491 INFO L272 TraceCheckUtils]: 79: Hoare triple {13882#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {13882#false} is VALID [2022-04-27 13:29:45,491 INFO L290 TraceCheckUtils]: 80: Hoare triple {13882#false} ~cond := #in~cond; {13882#false} is VALID [2022-04-27 13:29:45,491 INFO L290 TraceCheckUtils]: 81: Hoare triple {13882#false} assume !(0 == ~cond); {13882#false} is VALID [2022-04-27 13:29:45,492 INFO L290 TraceCheckUtils]: 82: Hoare triple {13882#false} assume true; {13882#false} is VALID [2022-04-27 13:29:45,492 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13882#false} {13882#false} #92#return; {13882#false} is VALID [2022-04-27 13:29:45,492 INFO L272 TraceCheckUtils]: 84: Hoare triple {13882#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {13882#false} is VALID [2022-04-27 13:29:45,492 INFO L290 TraceCheckUtils]: 85: Hoare triple {13882#false} ~cond := #in~cond; {13882#false} is VALID [2022-04-27 13:29:45,492 INFO L290 TraceCheckUtils]: 86: Hoare triple {13882#false} assume 0 == ~cond; {13882#false} is VALID [2022-04-27 13:29:45,492 INFO L290 TraceCheckUtils]: 87: Hoare triple {13882#false} assume !false; {13882#false} is VALID [2022-04-27 13:29:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-04-27 13:29:45,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:29:45,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:29:45,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515979611] [2022-04-27 13:29:45,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:29:45,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750462084] [2022-04-27 13:29:45,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750462084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:29:45,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:29:45,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:29:45,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699984164] [2022-04-27 13:29:45,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:29:45,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 88 [2022-04-27 13:29:45,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:29:45,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:29:45,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:29:45,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:29:45,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:29:45,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:29:45,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:29:45,527 INFO L87 Difference]: Start difference. First operand 229 states and 271 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:29:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:45,832 INFO L93 Difference]: Finished difference Result 249 states and 296 transitions. [2022-04-27 13:29:45,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:29:45,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 88 [2022-04-27 13:29:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:29:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:29:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-04-27 13:29:45,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:29:45,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-04-27 13:29:45,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 94 transitions. [2022-04-27 13:29:45,952 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-27 13:29:45,955 INFO L225 Difference]: With dead ends: 249 [2022-04-27 13:29:45,955 INFO L226 Difference]: Without dead ends: 228 [2022-04-27 13:29:45,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:29:45,956 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:29:45,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 103 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:29:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-04-27 13:29:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 218. [2022-04-27 13:29:46,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:29:46,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 218 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 150 states have internal predecessors, (167), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:29:46,100 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 218 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 150 states have internal predecessors, (167), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:29:46,100 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 218 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 150 states have internal predecessors, (167), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:29:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:46,104 INFO L93 Difference]: Finished difference Result 228 states and 267 transitions. [2022-04-27 13:29:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 267 transitions. [2022-04-27 13:29:46,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:46,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:46,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 150 states have internal predecessors, (167), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand 228 states. [2022-04-27 13:29:46,105 INFO L87 Difference]: Start difference. First operand has 218 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 150 states have internal predecessors, (167), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand 228 states. [2022-04-27 13:29:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:46,108 INFO L93 Difference]: Finished difference Result 228 states and 267 transitions. [2022-04-27 13:29:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 267 transitions. [2022-04-27 13:29:46,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:46,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:46,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:29:46,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:29:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 150 states have internal predecessors, (167), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:29:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 251 transitions. [2022-04-27 13:29:46,113 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 251 transitions. Word has length 88 [2022-04-27 13:29:46,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:29:46,113 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 251 transitions. [2022-04-27 13:29:46,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:29:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 251 transitions. [2022-04-27 13:29:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 13:29:46,114 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:29:46,114 INFO L195 NwaCegarLoop]: 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-27 13:29:46,139 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-27 13:29:46,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 13:29:46,339 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:29:46,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:29:46,340 INFO L85 PathProgramCache]: Analyzing trace with hash -543991253, now seen corresponding path program 3 times [2022-04-27 13:29:46,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:29:46,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217338461] [2022-04-27 13:29:46,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:29:46,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:29:46,353 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:29:46,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [853651090] [2022-04-27 13:29:46,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:29:46,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:29:46,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:29:46,354 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-27 13:29:46,363 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-27 13:29:46,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 13:29:46,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:29:46,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-27 13:29:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:29:46,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:29:48,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {15242#true} call ULTIMATE.init(); {15242#true} is VALID [2022-04-27 13:29:48,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {15242#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {15242#true} is VALID [2022-04-27 13:29:48,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:29:48,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15242#true} {15242#true} #96#return; {15242#true} is VALID [2022-04-27 13:29:48,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {15242#true} call #t~ret8 := main(); {15242#true} is VALID [2022-04-27 13:29:48,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {15242#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; {15242#true} is VALID [2022-04-27 13:29:48,714 INFO L272 TraceCheckUtils]: 6: Hoare triple {15242#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {15242#true} is VALID [2022-04-27 13:29:48,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {15242#true} ~cond := #in~cond; {15268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:29:48,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {15268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:29:48,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {15272#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:29:48,715 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15272#(not (= |assume_abort_if_not_#in~cond| 0))} {15242#true} #80#return; {15279#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:48,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {15279#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {15283#(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-27 13:29:48,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {15283#(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; {15283#(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-27 13:29:48,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {15283#(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; {15283#(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-27 13:29:48,717 INFO L272 TraceCheckUtils]: 14: Hoare triple {15283#(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)); {15242#true} is VALID [2022-04-27 13:29:48,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:29:48,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:29:48,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:29:48,717 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15242#true} {15283#(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; {15283#(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-27 13:29:48,717 INFO L272 TraceCheckUtils]: 19: Hoare triple {15283#(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)); {15242#true} is VALID [2022-04-27 13:29:48,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:29:48,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:29:48,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:29:48,718 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15242#true} {15283#(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; {15283#(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-27 13:29:48,718 INFO L272 TraceCheckUtils]: 24: Hoare triple {15283#(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)); {15242#true} is VALID [2022-04-27 13:29:48,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:29:48,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:29:48,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:29:48,719 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15242#true} {15283#(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; {15283#(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-27 13:29:48,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {15283#(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; {15338#(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-27 13:29:48,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {15338#(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; {15338#(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-27 13:29:48,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {15338#(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; {15338#(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-27 13:29:48,721 INFO L272 TraceCheckUtils]: 32: Hoare triple {15338#(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)); {15242#true} is VALID [2022-04-27 13:29:48,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:29:48,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:29:48,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:29:48,722 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {15242#true} {15338#(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; {15338#(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-27 13:29:48,722 INFO L272 TraceCheckUtils]: 37: Hoare triple {15338#(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)); {15242#true} is VALID [2022-04-27 13:29:48,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:29:48,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:29:48,723 INFO L290 TraceCheckUtils]: 40: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:29:48,723 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15242#true} {15338#(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; {15338#(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-27 13:29:48,723 INFO L272 TraceCheckUtils]: 42: Hoare triple {15338#(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)); {15242#true} is VALID [2022-04-27 13:29:48,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {15242#true} ~cond := #in~cond; {15381#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:29:48,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {15381#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:29:48,724 INFO L290 TraceCheckUtils]: 45: Hoare triple {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:29:48,725 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} {15338#(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; {15338#(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-27 13:29:48,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {15338#(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; {15395#(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-27 13:29:48,726 INFO L290 TraceCheckUtils]: 48: Hoare triple {15395#(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; {15395#(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-27 13:29:48,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {15395#(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; {15395#(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-27 13:29:48,727 INFO L272 TraceCheckUtils]: 50: Hoare triple {15395#(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)); {15242#true} is VALID [2022-04-27 13:29:48,727 INFO L290 TraceCheckUtils]: 51: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:29:48,727 INFO L290 TraceCheckUtils]: 52: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:29:48,727 INFO L290 TraceCheckUtils]: 53: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:29:48,728 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15242#true} {15395#(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; {15395#(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-27 13:29:48,728 INFO L272 TraceCheckUtils]: 55: Hoare triple {15395#(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)); {15242#true} is VALID [2022-04-27 13:29:48,728 INFO L290 TraceCheckUtils]: 56: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:29:48,728 INFO L290 TraceCheckUtils]: 57: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:29:48,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:29:48,728 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15242#true} {15395#(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; {15395#(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-27 13:29:48,728 INFO L272 TraceCheckUtils]: 60: Hoare triple {15395#(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)); {15242#true} is VALID [2022-04-27 13:29:48,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:29:48,729 INFO L290 TraceCheckUtils]: 62: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:29:48,729 INFO L290 TraceCheckUtils]: 63: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:29:48,729 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {15242#true} {15395#(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; {15395#(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-27 13:29:48,730 INFO L290 TraceCheckUtils]: 65: Hoare triple {15395#(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); {15395#(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-27 13:29:48,730 INFO L290 TraceCheckUtils]: 66: Hoare triple {15395#(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; {15395#(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-27 13:29:48,730 INFO L290 TraceCheckUtils]: 67: Hoare triple {15395#(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; {15395#(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-27 13:29:48,731 INFO L272 TraceCheckUtils]: 68: Hoare triple {15395#(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)); {15242#true} is VALID [2022-04-27 13:29:48,731 INFO L290 TraceCheckUtils]: 69: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:29:48,731 INFO L290 TraceCheckUtils]: 70: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:29:48,731 INFO L290 TraceCheckUtils]: 71: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:29:48,731 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15242#true} {15395#(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; {15395#(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-27 13:29:48,731 INFO L272 TraceCheckUtils]: 73: Hoare triple {15395#(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)); {15242#true} is VALID [2022-04-27 13:29:48,731 INFO L290 TraceCheckUtils]: 74: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:29:48,731 INFO L290 TraceCheckUtils]: 75: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:29:48,732 INFO L290 TraceCheckUtils]: 76: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:29:48,732 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15242#true} {15395#(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; {15395#(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-27 13:29:48,733 INFO L290 TraceCheckUtils]: 78: Hoare triple {15395#(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); {15338#(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-27 13:29:48,735 INFO L290 TraceCheckUtils]: 79: Hoare triple {15338#(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; {15492#(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-27 13:29:48,735 INFO L290 TraceCheckUtils]: 80: Hoare triple {15492#(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; {15492#(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-27 13:29:48,736 INFO L290 TraceCheckUtils]: 81: Hoare triple {15492#(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; {15492#(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-27 13:29:48,736 INFO L272 TraceCheckUtils]: 82: Hoare triple {15492#(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)); {15242#true} is VALID [2022-04-27 13:29:48,736 INFO L290 TraceCheckUtils]: 83: Hoare triple {15242#true} ~cond := #in~cond; {15381#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:29:48,736 INFO L290 TraceCheckUtils]: 84: Hoare triple {15381#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:29:48,736 INFO L290 TraceCheckUtils]: 85: Hoare triple {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:29:48,737 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} {15492#(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; {15492#(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-27 13:29:48,737 INFO L272 TraceCheckUtils]: 87: Hoare triple {15492#(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)); {15242#true} is VALID [2022-04-27 13:29:48,737 INFO L290 TraceCheckUtils]: 88: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:29:48,737 INFO L290 TraceCheckUtils]: 89: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:29:48,737 INFO L290 TraceCheckUtils]: 90: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:29:48,738 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15242#true} {15492#(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; {15492#(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-27 13:29:48,739 INFO L290 TraceCheckUtils]: 92: Hoare triple {15492#(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); {15532#(and (= 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)))) (= main_~p~0 1))} is VALID [2022-04-27 13:29:48,740 INFO L290 TraceCheckUtils]: 93: Hoare triple {15532#(and (= 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)))) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15536#(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-27 13:29:48,740 INFO L290 TraceCheckUtils]: 94: Hoare triple {15536#(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; {15536#(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-27 13:29:48,741 INFO L290 TraceCheckUtils]: 95: Hoare triple {15536#(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; {15536#(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-27 13:29:48,742 INFO L272 TraceCheckUtils]: 96: Hoare triple {15536#(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)); {15546#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:29:48,742 INFO L290 TraceCheckUtils]: 97: Hoare triple {15546#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15550#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:29:48,742 INFO L290 TraceCheckUtils]: 98: Hoare triple {15550#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15243#false} is VALID [2022-04-27 13:29:48,742 INFO L290 TraceCheckUtils]: 99: Hoare triple {15243#false} assume !false; {15243#false} is VALID [2022-04-27 13:29:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 69 proven. 53 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-27 13:29:48,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:32:36,644 WARN L232 SmtUtils]: Spent 9.97s on a formula simplification. DAG size of input: 51 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:35:46,133 INFO L290 TraceCheckUtils]: 99: Hoare triple {15243#false} assume !false; {15243#false} is VALID [2022-04-27 13:35:46,134 INFO L290 TraceCheckUtils]: 98: Hoare triple {15550#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15243#false} is VALID [2022-04-27 13:35:46,134 INFO L290 TraceCheckUtils]: 97: Hoare triple {15546#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15550#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:35:46,135 INFO L272 TraceCheckUtils]: 96: Hoare triple {15566#(= (+ 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)); {15546#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:35:46,135 INFO L290 TraceCheckUtils]: 95: Hoare triple {15566#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !!(#t~post7 < 50);havoc #t~post7; {15566#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:35:46,135 INFO L290 TraceCheckUtils]: 94: Hoare triple {15566#(= (+ 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; {15566#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:35:46,138 INFO L290 TraceCheckUtils]: 93: Hoare triple {15576#(= (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; {15566#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:35:46,148 INFO L290 TraceCheckUtils]: 92: Hoare triple {15580#(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); {15576#(= (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-27 13:35:46,149 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15242#true} {15580#(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; {15580#(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-27 13:35:46,149 INFO L290 TraceCheckUtils]: 90: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:35:46,149 INFO L290 TraceCheckUtils]: 89: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:35:46,149 INFO L290 TraceCheckUtils]: 88: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:35:46,149 INFO L272 TraceCheckUtils]: 87: Hoare triple {15580#(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)); {15242#true} is VALID [2022-04-27 13:35:46,150 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} {15599#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (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; {15580#(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-27 13:35:46,150 INFO L290 TraceCheckUtils]: 85: Hoare triple {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:35:46,150 INFO L290 TraceCheckUtils]: 84: Hoare triple {15609#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:35:46,151 INFO L290 TraceCheckUtils]: 83: Hoare triple {15242#true} ~cond := #in~cond; {15609#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:35:46,151 INFO L272 TraceCheckUtils]: 82: Hoare triple {15599#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (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)); {15242#true} is VALID [2022-04-27 13:35:46,152 INFO L290 TraceCheckUtils]: 81: Hoare triple {15599#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (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; {15599#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (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-27 13:35:46,153 INFO L290 TraceCheckUtils]: 80: Hoare triple {15599#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (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; {15599#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (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-27 13:35:46,158 INFO L290 TraceCheckUtils]: 79: Hoare triple {15622#(or (not (= (+ (* (- 1) main_~d~0) main_~r~0) (+ (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296))))) (and (or (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) (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 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; {15599#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (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-27 13:35:46,953 INFO L290 TraceCheckUtils]: 78: Hoare triple {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~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); {15622#(or (not (= (+ (* (- 1) main_~d~0) main_~r~0) (+ (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296))))) (and (or (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) (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 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-27 13:35:46,954 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15242#true} {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #90#return; {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:35:46,954 INFO L290 TraceCheckUtils]: 76: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:35:46,954 INFO L290 TraceCheckUtils]: 75: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:35:46,954 INFO L290 TraceCheckUtils]: 74: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:35:46,954 INFO L272 TraceCheckUtils]: 73: Hoare triple {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15242#true} is VALID [2022-04-27 13:35:46,957 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15242#true} {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #88#return; {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:35:46,957 INFO L290 TraceCheckUtils]: 71: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:35:46,957 INFO L290 TraceCheckUtils]: 70: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:35:46,957 INFO L290 TraceCheckUtils]: 69: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:35:46,957 INFO L272 TraceCheckUtils]: 68: Hoare triple {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {15242#true} is VALID [2022-04-27 13:35:46,961 INFO L290 TraceCheckUtils]: 67: Hoare triple {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !!(#t~post7 < 50);havoc #t~post7; {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:35:46,964 INFO L290 TraceCheckUtils]: 66: Hoare triple {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:35:46,967 INFO L290 TraceCheckUtils]: 65: Hoare triple {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !(~r~0 >= ~d~0); {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:35:46,969 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {15242#true} {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #86#return; {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:35:46,969 INFO L290 TraceCheckUtils]: 63: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:35:46,969 INFO L290 TraceCheckUtils]: 62: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:35:46,969 INFO L290 TraceCheckUtils]: 61: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:35:46,970 INFO L272 TraceCheckUtils]: 60: Hoare triple {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15242#true} is VALID [2022-04-27 13:35:46,971 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15242#true} {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #84#return; {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:35:46,971 INFO L290 TraceCheckUtils]: 58: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:35:46,971 INFO L290 TraceCheckUtils]: 57: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:35:46,971 INFO L290 TraceCheckUtils]: 56: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:35:46,971 INFO L272 TraceCheckUtils]: 55: Hoare triple {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {15242#true} is VALID [2022-04-27 13:35:46,973 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15242#true} {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #82#return; {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:35:46,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:35:46,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:35:46,973 INFO L290 TraceCheckUtils]: 51: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:35:46,973 INFO L272 TraceCheckUtils]: 50: Hoare triple {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15242#true} is VALID [2022-04-27 13:35:46,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !!(#t~post6 < 50);havoc #t~post6; {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:35:46,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:35:47,092 INFO L290 TraceCheckUtils]: 47: Hoare triple {15622#(or (not (= (+ (* (- 1) main_~d~0) main_~r~0) (+ (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296))))) (and (or (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) (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 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; {15626#(and (or (and (or (and (not (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0)) (< (+ (* (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))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (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)) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~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) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 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))) (= (mod (+ (mod main_~A~0 4294967296) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (not (< main_~p~0 0)) (and (or (not (< main_~d~0 0)) (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (not (= (+ (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (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 (or (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 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))) (and (or (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 1) (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))))))) (or (and (< (+ (* (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)) (not (= (mod (+ (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) 2) 0))) (and (or (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (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)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) 2)) (* (- 1) (mod main_~B~0 4294967296) (div main_~p~0 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))))) (and (or (not (= (+ (div main_~d~0 2) 1) (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* (- 1) (mod main_~A~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296))) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:35:47,098 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} {15723#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)) (not (= (+ (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))))))} #86#return; {15622#(or (not (= (+ (* (- 1) main_~d~0) main_~r~0) (+ (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296))))) (and (or (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) (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (mod main_~A~0 4294967296) (* (- 1) main_~p~0 (mod main_~B~0 4294967296)) (* (- 1) main_~q~0 (mod main_~B~0 4294967296)) (* (- 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-27 13:35:47,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:35:47,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {15609#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15385#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:35:47,099 INFO L290 TraceCheckUtils]: 43: Hoare triple {15242#true} ~cond := #in~cond; {15609#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:35:47,099 INFO L272 TraceCheckUtils]: 42: Hoare triple {15723#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)) (not (= (+ (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))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15242#true} is VALID [2022-04-27 13:35:47,100 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15242#true} {15723#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)) (not (= (+ (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))))))} #84#return; {15723#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)) (not (= (+ (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))))))} is VALID [2022-04-27 13:35:47,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:35:47,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:35:47,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:35:47,100 INFO L272 TraceCheckUtils]: 37: Hoare triple {15723#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)) (not (= (+ (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))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {15242#true} is VALID [2022-04-27 13:35:47,100 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {15242#true} {15723#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)) (not (= (+ (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))))))} #82#return; {15723#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)) (not (= (+ (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))))))} is VALID [2022-04-27 13:35:47,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:35:47,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:35:47,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:35:47,101 INFO L272 TraceCheckUtils]: 32: Hoare triple {15723#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)) (not (= (+ (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))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15242#true} is VALID [2022-04-27 13:35:47,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {15723#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)) (not (= (+ (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))))))} assume !!(#t~post6 < 50);havoc #t~post6; {15723#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)) (not (= (+ (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))))))} is VALID [2022-04-27 13:35:47,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {15723#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)) (not (= (+ (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))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15723#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)) (not (= (+ (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))))))} is VALID [2022-04-27 13:35:47,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {15242#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15723#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)) (not (= (+ (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))))))} is VALID [2022-04-27 13:35:47,854 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15242#true} {15242#true} #86#return; {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L272 TraceCheckUtils]: 24: Hoare triple {15242#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15242#true} {15242#true} #84#return; {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L272 TraceCheckUtils]: 19: Hoare triple {15242#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15242#true} {15242#true} #82#return; {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:35:47,854 INFO L272 TraceCheckUtils]: 14: Hoare triple {15242#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {15242#true} assume !!(#t~post6 < 50);havoc #t~post6; {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {15242#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {15242#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15242#true} {15242#true} #80#return; {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {15242#true} assume !(0 == ~cond); {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {15242#true} ~cond := #in~cond; {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L272 TraceCheckUtils]: 6: Hoare triple {15242#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {15242#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; {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {15242#true} call #t~ret8 := main(); {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15242#true} {15242#true} #96#return; {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {15242#true} assume true; {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {15242#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {15242#true} is VALID [2022-04-27 13:35:47,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {15242#true} call ULTIMATE.init(); {15242#true} is VALID [2022-04-27 13:35:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 81 proven. 41 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-27 13:35:47,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:35:47,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217338461] [2022-04-27 13:35:47,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:35:47,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853651090] [2022-04-27 13:35:47,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853651090] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:35:47,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:35:47,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2022-04-27 13:35:47,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511647313] [2022-04-27 13:35:47,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:35:47,857 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 20 states have internal predecessors, (60), 11 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 10 states have call predecessors, (29), 9 states have call successors, (29) Word has length 100 [2022-04-27 13:35:47,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:35:47,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 20 states have internal predecessors, (60), 11 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 10 states have call predecessors, (29), 9 states have call successors, (29) [2022-04-27 13:35:49,411 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-27 13:35:49,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 13:35:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:35:49,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 13:35:49,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2022-04-27 13:35:49,412 INFO L87 Difference]: Start difference. First operand 218 states and 251 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 20 states have internal predecessors, (60), 11 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 10 states have call predecessors, (29), 9 states have call successors, (29) [2022-04-27 13:36:27,128 WARN L232 SmtUtils]: Spent 27.67s on a formula simplification. DAG size of input: 184 DAG size of output: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:36:52,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []