/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/hard2_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:45:28,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:45:28,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:45:28,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:45:28,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:45:28,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:45:28,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:45:28,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:45:28,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:45:28,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:45:28,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:45:28,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:45:28,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:45:28,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:45:28,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:45:28,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:45:28,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:45:28,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:45:28,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:45:28,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:45:28,249 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:45:28,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:45:28,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:45:28,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:45:28,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:45:28,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:45:28,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:45:28,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:45:28,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:45:28,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:45:28,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:45:28,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:45:28,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:45:28,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:45:28,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:45:28,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:45:28,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:45:28,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:45:28,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:45:28,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:45:28,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:45:28,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:45:28,260 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:45:28,278 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:45:28,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:45:28,278 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:45:28,278 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:45:28,279 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:45:28,279 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:45:28,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:45:28,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:45:28,280 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:45:28,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:45:28,280 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:45:28,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:45:28,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:45:28,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:45:28,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:45:28,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:45:28,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:45:28,281 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:45:28,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:45:28,281 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:45:28,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:45:28,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:45:28,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:45:28,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:45:28,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:45:28,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:45:28,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:45:28,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:45:28,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:45:28,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:45:28,283 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:45:28,283 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:45:28,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:45:28,283 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:45:28,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:45:28,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:45:28,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:45:28,517 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:45:28,517 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:45:28,518 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound20.c [2022-04-27 13:45:28,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ab9ec53/dd50debb6d294f35ac3ccbbd71ca61c9/FLAG056b19c7b [2022-04-27 13:45:28,914 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:45:28,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound20.c [2022-04-27 13:45:28,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ab9ec53/dd50debb6d294f35ac3ccbbd71ca61c9/FLAG056b19c7b [2022-04-27 13:45:29,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ab9ec53/dd50debb6d294f35ac3ccbbd71ca61c9 [2022-04-27 13:45:29,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:45:29,355 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:45:29,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:45:29,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:45:29,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:45:29,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:45:29" (1/1) ... [2022-04-27 13:45:29,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b70d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:29, skipping insertion in model container [2022-04-27 13:45:29,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:45:29" (1/1) ... [2022-04-27 13:45:29,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:45:29,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:45:29,513 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/hard2_unwindbound20.c[526,539] [2022-04-27 13:45:29,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:45:29,548 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:45:29,559 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/hard2_unwindbound20.c[526,539] [2022-04-27 13:45:29,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:45:29,587 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:45:29,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:29 WrapperNode [2022-04-27 13:45:29,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:45:29,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:45:29,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:45:29,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:45:29,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:29" (1/1) ... [2022-04-27 13:45:29,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:29" (1/1) ... [2022-04-27 13:45:29,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:29" (1/1) ... [2022-04-27 13:45:29,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:29" (1/1) ... [2022-04-27 13:45:29,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:29" (1/1) ... [2022-04-27 13:45:29,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:29" (1/1) ... [2022-04-27 13:45:29,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:29" (1/1) ... [2022-04-27 13:45:29,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:45:29,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:45:29,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:45:29,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:45:29,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:29" (1/1) ... [2022-04-27 13:45:29,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:45:29,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:29,669 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:45:29,691 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:45:29,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:45:29,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:45:29,703 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:45:29,704 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:45:29,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:45:29,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:45:29,704 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:45:29,704 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:45:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:45:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:45:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:45:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:45:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:45:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:45:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:45:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:45:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:45:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:45:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:45:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:45:29,754 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:45:29,756 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:45:29,910 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:45:29,915 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:45:29,915 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:45:29,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:45:29 BoogieIcfgContainer [2022-04-27 13:45:29,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:45:29,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:45:29,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:45:29,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:45:29,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:45:29" (1/3) ... [2022-04-27 13:45:29,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34847ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:45:29, skipping insertion in model container [2022-04-27 13:45:29,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:29" (2/3) ... [2022-04-27 13:45:29,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34847ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:45:29, skipping insertion in model container [2022-04-27 13:45:29,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:45:29" (3/3) ... [2022-04-27 13:45:29,923 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound20.c [2022-04-27 13:45:29,932 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:45:29,932 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:45:29,992 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:45:30,010 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@15bcaec7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@14e3a7ab [2022-04-27 13:45:30,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:45:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:45:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:45:30,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:30,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:30,025 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:30,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:30,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-27 13:45:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:30,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055070895] [2022-04-27 13:45:30,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:30,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:30,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:45:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:30,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-27 13:45:30,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 13:45:30,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-27 13:45:30,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:45:30,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-27 13:45:30,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 13:45:30,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-27 13:45:30,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-27 13:45:30,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {34#true} is VALID [2022-04-27 13:45:30,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-27 13:45:30,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-27 13:45:30,208 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35#false} is VALID [2022-04-27 13:45:30,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 13:45:30,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 13:45:30,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 13:45:30,209 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:45:30,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:30,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055070895] [2022-04-27 13:45:30,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055070895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:30,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:30,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:45:30,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106705529] [2022-04-27 13:45:30,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:30,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 13:45:30,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:30,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:30,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:30,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:45:30,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:30,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:45:30,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:45:30,267 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:30,410 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-27 13:45:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:45:30,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 13:45:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-27 13:45:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-27 13:45:30,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-27 13:45:30,543 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:45:30,550 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:45:30,550 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:45:30,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:45:30,560 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:30,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:45:30,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:45:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 13:45:30,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:30,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:30,596 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:30,596 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:30,606 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-27 13:45:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-27 13:45:30,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:30,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:30,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-27 13:45:30,611 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-27 13:45:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:30,621 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-27 13:45:30,621 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-27 13:45:30,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:30,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:30,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:30,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-27 13:45:30,625 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-27 13:45:30,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:30,626 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-27 13:45:30,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-27 13:45:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:45:30,627 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:30,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:30,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:45:30,627 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:30,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-27 13:45:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:30,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164694267] [2022-04-27 13:45:30,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:30,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:45:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:30,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {223#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {215#true} is VALID [2022-04-27 13:45:30,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 13:45:30,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215#true} {215#true} #92#return; {215#true} is VALID [2022-04-27 13:45:30,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:45:30,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {215#true} is VALID [2022-04-27 13:45:30,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 13:45:30,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #92#return; {215#true} is VALID [2022-04-27 13:45:30,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret7 := main(); {215#true} is VALID [2022-04-27 13:45:30,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {220#(= main_~q~0 0)} is VALID [2022-04-27 13:45:30,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(= main_~q~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {220#(= main_~q~0 0)} is VALID [2022-04-27 13:45:30,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(= main_~q~0 0)} assume !!(#t~post5 < 20);havoc #t~post5; {220#(= main_~q~0 0)} is VALID [2022-04-27 13:45:30,774 INFO L272 TraceCheckUtils]: 8: Hoare triple {220#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {221#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:45:30,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {222#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:45:30,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {222#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {216#false} is VALID [2022-04-27 13:45:30,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-04-27 13:45:30,776 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:45:30,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:30,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164694267] [2022-04-27 13:45:30,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164694267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:30,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:30,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:45:30,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724534220] [2022-04-27 13:45:30,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:30,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 13:45:30,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:30,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:30,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:30,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:45:30,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:30,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:45:30,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:45:30,791 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:31,098 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-27 13:45:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:45:31,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 13:45:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:45:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:45:31,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-27 13:45:31,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:31,169 INFO L225 Difference]: With dead ends: 41 [2022-04-27 13:45:31,169 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 13:45:31,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:45:31,174 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:31,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:45:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 13:45:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-27 13:45:31,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:31,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:31,185 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:31,185 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:31,189 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 13:45:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-27 13:45:31,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:31,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:31,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-27 13:45:31,197 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-27 13:45:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:31,204 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 13:45:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-27 13:45:31,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:31,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:31,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:31,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-27 13:45:31,208 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-27 13:45:31,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:31,209 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-27 13:45:31,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-27 13:45:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 13:45:31,210 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:31,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:31,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:45:31,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:31,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:31,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-27 13:45:31,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:31,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116698054] [2022-04-27 13:45:31,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:31,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:31,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:45:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:31,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:31,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#(<= ~counter~0 0)} assume true; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:31,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} #92#return; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:31,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} call ULTIMATE.init(); {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:45:31,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:31,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#(<= ~counter~0 0)} assume true; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:31,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} #92#return; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:31,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {421#(<= ~counter~0 0)} call #t~ret7 := main(); {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:31,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {421#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:31,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {422#(<= |main_#t~post5| 0)} is VALID [2022-04-27 13:45:31,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {417#false} is VALID [2022-04-27 13:45:31,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {417#false} is VALID [2022-04-27 13:45:31,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#false} assume !(#t~post6 < 20);havoc #t~post6; {417#false} is VALID [2022-04-27 13:45:31,297 INFO L272 TraceCheckUtils]: 10: Hoare triple {417#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {417#false} is VALID [2022-04-27 13:45:31,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {417#false} ~cond := #in~cond; {417#false} is VALID [2022-04-27 13:45:31,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#false} assume 0 == ~cond; {417#false} is VALID [2022-04-27 13:45:31,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#false} assume !false; {417#false} is VALID [2022-04-27 13:45:31,298 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:45:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:31,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116698054] [2022-04-27 13:45:31,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116698054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:31,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:31,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:45:31,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103786922] [2022-04-27 13:45:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:31,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 13:45:31,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:31,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:31,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:31,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:45:31,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:31,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:45:31,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:45:31,338 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:31,530 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-27 13:45:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:45:31,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 13:45:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:31,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-27 13:45:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-27 13:45:31,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-27 13:45:31,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:31,579 INFO L225 Difference]: With dead ends: 46 [2022-04-27 13:45:31,580 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 13:45:31,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:45:31,586 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:31,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:45:31,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 13:45:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 13:45:31,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:31,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:31,596 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:31,596 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:31,599 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:45:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:45:31,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:31,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:31,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-27 13:45:31,602 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-27 13:45:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:31,605 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:45:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:45:31,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:31,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:31,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:31,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 13:45:31,608 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-27 13:45:31,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:31,608 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 13:45:31,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:45:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 13:45:31,609 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:31,609 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:31,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 13:45:31,610 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:31,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-27 13:45:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:31,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158925633] [2022-04-27 13:45:31,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:31,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:45:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:31,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {617#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {605#true} is VALID [2022-04-27 13:45:31,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:45:31,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-27 13:45:31,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-27 13:45:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:31,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:45:31,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:45:31,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:45:31,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {610#(= main_~A~0 main_~r~0)} #78#return; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:45:31,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:45:31,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {605#true} is VALID [2022-04-27 13:45:31,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:45:31,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-27 13:45:31,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret7 := main(); {605#true} is VALID [2022-04-27 13:45:31,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:45:31,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {610#(= main_~A~0 main_~r~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:45:31,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {610#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 20);havoc #t~post5; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:45:31,671 INFO L272 TraceCheckUtils]: 8: Hoare triple {610#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {605#true} is VALID [2022-04-27 13:45:31,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:45:31,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:45:31,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:45:31,671 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {605#true} {610#(= main_~A~0 main_~r~0)} #78#return; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:45:31,672 INFO L272 TraceCheckUtils]: 13: Hoare triple {610#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {615#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:45:31,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {615#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {616#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:45:31,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {606#false} is VALID [2022-04-27 13:45:31,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {606#false} assume !false; {606#false} is VALID [2022-04-27 13:45:31,673 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:45:31,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:31,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158925633] [2022-04-27 13:45:31,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158925633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:31,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:31,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:45:31,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500076249] [2022-04-27 13:45:31,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:31,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 13:45:31,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:31,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:45:31,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:31,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:45:31,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:31,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:45:31,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:45:31,688 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:45:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:31,958 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-27 13:45:31,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:45:31,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 13:45:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:45:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:45:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:45:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:45:31,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-27 13:45:32,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:32,002 INFO L225 Difference]: With dead ends: 46 [2022-04-27 13:45:32,002 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 13:45:32,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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:45:32,003 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:32,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:45:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 13:45:32,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-27 13:45:32,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:32,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:32,009 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:32,009 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:32,011 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:45:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:45:32,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:32,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:32,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-27 13:45:32,012 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-27 13:45:32,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:32,013 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:45:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:45:32,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:32,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:32,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:32,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-27 13:45:32,015 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-27 13:45:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:32,016 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-27 13:45:32,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:45:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-27 13:45:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:45:32,016 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:32,017 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:32,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 13:45:32,017 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:32,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-27 13:45:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:32,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899311117] [2022-04-27 13:45:32,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:32,026 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:32,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1238133013] [2022-04-27 13:45:32,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:32,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:32,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:32,028 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:45:32,061 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:45:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:32,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:45:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:32,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:45:32,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} call ULTIMATE.init(); {834#true} is VALID [2022-04-27 13:45:32,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {834#true} is VALID [2022-04-27 13:45:32,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:45:32,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} #92#return; {834#true} is VALID [2022-04-27 13:45:32,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} call #t~ret7 := main(); {834#true} is VALID [2022-04-27 13:45:32,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:32,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:32,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:32,242 INFO L272 TraceCheckUtils]: 8: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {834#true} is VALID [2022-04-27 13:45:32,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#true} ~cond := #in~cond; {834#true} is VALID [2022-04-27 13:45:32,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {834#true} assume !(0 == ~cond); {834#true} is VALID [2022-04-27 13:45:32,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:45:32,243 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {834#true} {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:32,243 INFO L272 TraceCheckUtils]: 13: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {834#true} is VALID [2022-04-27 13:45:32,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {834#true} ~cond := #in~cond; {834#true} is VALID [2022-04-27 13:45:32,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#true} assume !(0 == ~cond); {834#true} is VALID [2022-04-27 13:45:32,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:45:32,244 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {834#true} {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:32,245 INFO L272 TraceCheckUtils]: 18: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:45:32,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:45:32,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {835#false} is VALID [2022-04-27 13:45:32,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {835#false} assume !false; {835#false} is VALID [2022-04-27 13:45:32,247 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:45:32,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:45:32,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:32,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899311117] [2022-04-27 13:45:32,248 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:45:32,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238133013] [2022-04-27 13:45:32,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238133013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:32,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:32,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:45:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487709796] [2022-04-27 13:45:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:32,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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 22 [2022-04-27 13:45:32,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:32,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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:45:32,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:32,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:45:32,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:32,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:45:32,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:45:32,262 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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:45:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:32,438 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-27 13:45:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:45:32,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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 22 [2022-04-27 13:45:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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:45:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-27 13:45:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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:45:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-27 13:45:32,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-27 13:45:32,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:32,492 INFO L225 Difference]: With dead ends: 65 [2022-04-27 13:45:32,492 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:45:32,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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:45:32,494 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:32,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:45:32,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:45:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-27 13:45:32,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:32,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:32,513 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:32,514 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:32,517 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:45:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:45:32,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:32,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:32,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-27 13:45:32,518 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-27 13:45:32,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:32,521 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:45:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:45:32,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:32,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:32,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:32,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-27 13:45:32,527 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-27 13:45:32,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:32,529 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-27 13:45:32,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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:45:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:45:32,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:45:32,533 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:32,533 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] [2022-04-27 13:45:32,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:45:32,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:32,748 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-27 13:45:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:32,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927358215] [2022-04-27 13:45:32,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:32,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:32,758 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:32,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164982217] [2022-04-27 13:45:32,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:32,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:32,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:32,759 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:45:32,760 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:45:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:32,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:45:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:32,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:45:32,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1173#true} is VALID [2022-04-27 13:45:32,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:32,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#(<= ~counter~0 0)} assume true; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:32,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#(<= ~counter~0 0)} {1173#true} #92#return; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:32,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#(<= ~counter~0 0)} call #t~ret7 := main(); {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:32,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {1181#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:32,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {1181#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:32,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {1197#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:32,994 INFO L272 TraceCheckUtils]: 8: Hoare triple {1197#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:32,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:32,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:32,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:32,995 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #78#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:32,996 INFO L272 TraceCheckUtils]: 13: Hoare triple {1197#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:32,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:33,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:33,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:33,002 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #80#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:33,002 INFO L272 TraceCheckUtils]: 18: Hoare triple {1197#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:33,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:33,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:33,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:33,003 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #82#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:33,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {1197#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:33,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {1197#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1252#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:45:33,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {1252#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {1174#false} is VALID [2022-04-27 13:45:33,005 INFO L272 TraceCheckUtils]: 26: Hoare triple {1174#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1174#false} is VALID [2022-04-27 13:45:33,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {1174#false} ~cond := #in~cond; {1174#false} is VALID [2022-04-27 13:45:33,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {1174#false} assume 0 == ~cond; {1174#false} is VALID [2022-04-27 13:45:33,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-27 13:45:33,005 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:45:33,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:45:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:33,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927358215] [2022-04-27 13:45:33,006 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:45:33,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164982217] [2022-04-27 13:45:33,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164982217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:33,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:33,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:45:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921118766] [2022-04-27 13:45:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:33,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-27 13:45:33,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:33,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:33,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:33,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:45:33,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:33,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:45:33,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:45:33,021 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:33,103 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-27 13:45:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:45:33,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-27 13:45:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:45:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:45:33,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 13:45:33,139 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:45:33,140 INFO L225 Difference]: With dead ends: 70 [2022-04-27 13:45:33,140 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 13:45:33,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:45:33,141 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:33,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:45:33,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 13:45:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-27 13:45:33,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:33,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:33,151 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:33,151 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:33,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:33,153 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 13:45:33,153 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 13:45:33,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:33,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:33,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-27 13:45:33,153 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-27 13:45:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:33,155 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 13:45:33,155 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 13:45:33,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:33,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:33,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:33,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-27 13:45:33,157 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-27 13:45:33,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:33,157 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-27 13:45:33,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-27 13:45:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:45:33,158 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:33,158 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] [2022-04-27 13:45:33,177 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:45:33,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-27 13:45:33,378 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:33,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-27 13:45:33,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:33,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954685042] [2022-04-27 13:45:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:33,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:33,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638325081] [2022-04-27 13:45:33,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:33,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:33,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:33,389 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:45:33,390 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:45:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:33,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:45:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:33,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:45:37,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {1580#true} call ULTIMATE.init(); {1580#true} is VALID [2022-04-27 13:45:37,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {1580#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1580#true} is VALID [2022-04-27 13:45:37,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:45:37,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1580#true} {1580#true} #92#return; {1580#true} is VALID [2022-04-27 13:45:37,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {1580#true} call #t~ret7 := main(); {1580#true} is VALID [2022-04-27 13:45:37,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {1580#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:37,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:37,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:37,570 INFO L272 TraceCheckUtils]: 8: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1580#true} is VALID [2022-04-27 13:45:37,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:45:37,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:45:37,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:45:37,575 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:37,576 INFO L272 TraceCheckUtils]: 13: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1580#true} is VALID [2022-04-27 13:45:37,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:45:37,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:45:37,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:45:37,579 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:37,580 INFO L272 TraceCheckUtils]: 18: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1580#true} is VALID [2022-04-27 13:45:37,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:45:37,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:45:37,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:45:37,581 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:37,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:37,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:37,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:37,583 INFO L272 TraceCheckUtils]: 26: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1664#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:45:37,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {1664#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1668#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:45:37,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {1668#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1581#false} is VALID [2022-04-27 13:45:37,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {1581#false} assume !false; {1581#false} is VALID [2022-04-27 13:45:37,584 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:45:37,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:45:37,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:37,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954685042] [2022-04-27 13:45:37,584 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:45:37,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638325081] [2022-04-27 13:45:37,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638325081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:37,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:37,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:45:37,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872548090] [2022-04-27 13:45:37,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:37,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 30 [2022-04-27 13:45:37,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:37,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:45:37,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:37,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:45:37,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:37,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:45:37,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:45:37,603 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:45:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:37,745 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-27 13:45:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:45:37,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 30 [2022-04-27 13:45:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:45:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 13:45:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:45:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 13:45:37,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-27 13:45:37,786 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:45:37,787 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:45:37,787 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 13:45:37,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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:45:37,788 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:37,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:45:37,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 13:45:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-27 13:45:37,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:37,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:45:37,800 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:45:37,800 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:45:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:37,802 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 13:45:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 13:45:37,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:37,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:37,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-27 13:45:37,803 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-27 13:45:37,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:37,805 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 13:45:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 13:45:37,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:37,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:37,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:37,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:45:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-27 13:45:37,807 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-27 13:45:37,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:37,807 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-27 13:45:37,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:45:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 13:45:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 13:45:37,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:37,808 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:37,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:45:38,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:38,027 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-27 13:45:38,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:38,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539395799] [2022-04-27 13:45:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:38,039 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:38,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125872047] [2022-04-27 13:45:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:38,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:38,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:38,045 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:45:38,046 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:45:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:38,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:45:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:38,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:45:38,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-27 13:45:38,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:38,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {2008#(<= ~counter~0 0)} assume true; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:38,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2008#(<= ~counter~0 0)} {2000#true} #92#return; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:38,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {2008#(<= ~counter~0 0)} call #t~ret7 := main(); {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:38,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {2008#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:38,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {2008#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {2024#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,224 INFO L272 TraceCheckUtils]: 8: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,225 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #78#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,226 INFO L272 TraceCheckUtils]: 13: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,234 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #80#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,234 INFO L272 TraceCheckUtils]: 18: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,237 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #82#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {2024#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:38,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {2024#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(<= |main_#t~post5| 1)} is VALID [2022-04-27 13:45:38,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {2079#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {2001#false} is VALID [2022-04-27 13:45:38,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {2001#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2001#false} is VALID [2022-04-27 13:45:38,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} assume !(#t~post6 < 20);havoc #t~post6; {2001#false} is VALID [2022-04-27 13:45:38,239 INFO L272 TraceCheckUtils]: 28: Hoare triple {2001#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2001#false} is VALID [2022-04-27 13:45:38,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:45:38,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {2001#false} assume !(0 == ~cond); {2001#false} is VALID [2022-04-27 13:45:38,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {2001#false} assume true; {2001#false} is VALID [2022-04-27 13:45:38,240 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2001#false} {2001#false} #88#return; {2001#false} is VALID [2022-04-27 13:45:38,240 INFO L272 TraceCheckUtils]: 33: Hoare triple {2001#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2001#false} is VALID [2022-04-27 13:45:38,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:45:38,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} assume 0 == ~cond; {2001#false} is VALID [2022-04-27 13:45:38,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-27 13:45:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 13:45:38,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:45:38,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-27 13:45:38,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} assume 0 == ~cond; {2001#false} is VALID [2022-04-27 13:45:38,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:45:38,419 INFO L272 TraceCheckUtils]: 33: Hoare triple {2001#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2001#false} is VALID [2022-04-27 13:45:38,419 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2000#true} {2001#false} #88#return; {2001#false} is VALID [2022-04-27 13:45:38,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:45:38,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:45:38,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:45:38,419 INFO L272 TraceCheckUtils]: 28: Hoare triple {2001#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:45:38,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} assume !(#t~post6 < 20);havoc #t~post6; {2001#false} is VALID [2022-04-27 13:45:38,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {2001#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2001#false} is VALID [2022-04-27 13:45:38,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {2149#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2001#false} is VALID [2022-04-27 13:45:38,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {2153#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2149#(< |main_#t~post5| 20)} is VALID [2022-04-27 13:45:38,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {2153#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2153#(< ~counter~0 20)} is VALID [2022-04-27 13:45:38,424 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2000#true} {2153#(< ~counter~0 20)} #82#return; {2153#(< ~counter~0 20)} is VALID [2022-04-27 13:45:38,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:45:38,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:45:38,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:45:38,424 INFO L272 TraceCheckUtils]: 18: Hoare triple {2153#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:45:38,425 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2000#true} {2153#(< ~counter~0 20)} #80#return; {2153#(< ~counter~0 20)} is VALID [2022-04-27 13:45:38,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:45:38,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:45:38,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:45:38,425 INFO L272 TraceCheckUtils]: 13: Hoare triple {2153#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:45:38,425 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2000#true} {2153#(< ~counter~0 20)} #78#return; {2153#(< ~counter~0 20)} is VALID [2022-04-27 13:45:38,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:45:38,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:45:38,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:45:38,426 INFO L272 TraceCheckUtils]: 8: Hoare triple {2153#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:45:38,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {2153#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {2153#(< ~counter~0 20)} is VALID [2022-04-27 13:45:38,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {2208#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2153#(< ~counter~0 20)} is VALID [2022-04-27 13:45:38,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {2208#(< ~counter~0 19)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2208#(< ~counter~0 19)} is VALID [2022-04-27 13:45:38,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {2208#(< ~counter~0 19)} call #t~ret7 := main(); {2208#(< ~counter~0 19)} is VALID [2022-04-27 13:45:38,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2208#(< ~counter~0 19)} {2000#true} #92#return; {2208#(< ~counter~0 19)} is VALID [2022-04-27 13:45:38,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {2208#(< ~counter~0 19)} assume true; {2208#(< ~counter~0 19)} is VALID [2022-04-27 13:45:38,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2208#(< ~counter~0 19)} is VALID [2022-04-27 13:45:38,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-27 13:45:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:45:38,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:38,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539395799] [2022-04-27 13:45:38,428 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:45:38,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125872047] [2022-04-27 13:45:38,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125872047] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:45:38,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:45:38,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:45:38,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408374249] [2022-04-27 13:45:38,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:45:38,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2022-04-27 13:45:38,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:38,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:45:38,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:38,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:45:38,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:45:38,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:45:38,464 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:45:38,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:38,671 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2022-04-27 13:45:38,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:45:38,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2022-04-27 13:45:38,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:38,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:45:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-27 13:45:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:45:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-27 13:45:38,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-27 13:45:38,751 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:45:38,753 INFO L225 Difference]: With dead ends: 144 [2022-04-27 13:45:38,753 INFO L226 Difference]: Without dead ends: 119 [2022-04-27 13:45:38,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 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:45:38,754 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:38,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 149 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:45:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-27 13:45:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-04-27 13:45:38,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:38,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:45:38,789 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:45:38,790 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:45:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:38,793 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2022-04-27 13:45:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2022-04-27 13:45:38,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:38,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:38,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 119 states. [2022-04-27 13:45:38,794 INFO L87 Difference]: Start difference. First operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 119 states. [2022-04-27 13:45:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:38,797 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2022-04-27 13:45:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2022-04-27 13:45:38,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:38,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:38,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:38,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:45:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-04-27 13:45:38,801 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 37 [2022-04-27 13:45:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:38,802 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-04-27 13:45:38,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:45:38,804 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-27 13:45:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 13:45:38,804 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:38,804 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] [2022-04-27 13:45:38,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:45:39,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:39,019 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:39,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-27 13:45:39,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:39,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162482053] [2022-04-27 13:45:39,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:39,028 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:39,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [292439023] [2022-04-27 13:45:39,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:39,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:39,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:39,029 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:45:39,030 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:45:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:39,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:45:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:39,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:45:39,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {2830#true} call ULTIMATE.init(); {2830#true} is VALID [2022-04-27 13:45:39,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {2830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2830#true} is VALID [2022-04-27 13:45:39,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:45:39,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2830#true} {2830#true} #92#return; {2830#true} is VALID [2022-04-27 13:45:39,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {2830#true} call #t~ret7 := main(); {2830#true} is VALID [2022-04-27 13:45:39,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {2830#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:39,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:39,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:39,242 INFO L272 TraceCheckUtils]: 8: Hoare triple {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:45:39,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:45:39,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:45:39,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:45:39,243 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2830#true} {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:39,243 INFO L272 TraceCheckUtils]: 13: Hoare triple {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:45:39,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:45:39,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:45:39,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:45:39,248 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2830#true} {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:39,248 INFO L272 TraceCheckUtils]: 18: Hoare triple {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:45:39,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:45:39,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:45:39,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:45:39,250 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2830#true} {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:39,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:45:39,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:45:39,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:45:39,252 INFO L272 TraceCheckUtils]: 26: Hoare triple {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:45:39,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:45:39,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:45:39,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:45:39,254 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2830#true} {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:45:39,255 INFO L272 TraceCheckUtils]: 31: Hoare triple {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:45:39,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:45:39,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:45:39,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:45:39,255 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2830#true} {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #80#return; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:45:39,256 INFO L272 TraceCheckUtils]: 36: Hoare triple {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:45:39,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:45:39,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {2949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2831#false} is VALID [2022-04-27 13:45:39,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {2831#false} assume !false; {2831#false} is VALID [2022-04-27 13:45:39,257 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:45:39,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:45:39,465 INFO L290 TraceCheckUtils]: 39: Hoare triple {2831#false} assume !false; {2831#false} is VALID [2022-04-27 13:45:39,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {2949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2831#false} is VALID [2022-04-27 13:45:39,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:45:39,467 INFO L272 TraceCheckUtils]: 36: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:45:39,467 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:39,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:45:39,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:45:39,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:45:39,467 INFO L272 TraceCheckUtils]: 31: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:45:39,468 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:39,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:45:39,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:45:39,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:45:39,468 INFO L272 TraceCheckUtils]: 26: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:45:39,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 20);havoc #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:39,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:39,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:39,480 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #82#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:39,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:45:39,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:45:39,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:45:39,480 INFO L272 TraceCheckUtils]: 18: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:45:39,481 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:39,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:45:39,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:45:39,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:45:39,481 INFO L272 TraceCheckUtils]: 13: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:45:39,482 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:39,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:45:39,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:45:39,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:45:39,482 INFO L272 TraceCheckUtils]: 8: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:45:39,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 20);havoc #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:39,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:39,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {2830#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:39,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {2830#true} call #t~ret7 := main(); {2830#true} is VALID [2022-04-27 13:45:39,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2830#true} {2830#true} #92#return; {2830#true} is VALID [2022-04-27 13:45:39,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:45:39,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {2830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2830#true} is VALID [2022-04-27 13:45:39,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {2830#true} call ULTIMATE.init(); {2830#true} is VALID [2022-04-27 13:45:39,485 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:45:39,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:39,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162482053] [2022-04-27 13:45:39,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:45:39,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292439023] [2022-04-27 13:45:39,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292439023] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:45:39,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:45:39,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 13:45:39,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458278997] [2022-04-27 13:45:39,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:39,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 40 [2022-04-27 13:45:39,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:39,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:45:39,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:39,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:45:39,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:39,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:45:39,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 13:45:39,503 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:45:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:41,658 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2022-04-27 13:45:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:45:41,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 40 [2022-04-27 13:45:41,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:45:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:45:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:45:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:45:41,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-27 13:45:41,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:41,699 INFO L225 Difference]: With dead ends: 129 [2022-04-27 13:45:41,700 INFO L226 Difference]: Without dead ends: 125 [2022-04-27 13:45:41,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:45:41,700 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:41,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:45:41,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-27 13:45:41,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2022-04-27 13:45:41,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:41,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:45:41,727 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:45:41,727 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:45:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:41,730 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-04-27 13:45:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-04-27 13:45:41,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:41,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:41,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 125 states. [2022-04-27 13:45:41,731 INFO L87 Difference]: Start difference. First operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 125 states. [2022-04-27 13:45:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:41,734 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-04-27 13:45:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-04-27 13:45:41,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:41,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:41,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:41,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:45:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2022-04-27 13:45:41,738 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 40 [2022-04-27 13:45:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:41,738 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2022-04-27 13:45:41,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:45:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2022-04-27 13:45:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 13:45:41,738 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:41,738 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:41,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 13:45:41,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:41,954 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:41,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:41,954 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-27 13:45:41,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:41,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657880658] [2022-04-27 13:45:41,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:41,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:41,966 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:41,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921277324] [2022-04-27 13:45:41,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:41,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:41,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:41,975 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:45:41,976 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:45:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:42,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:45:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:42,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:45:42,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2022-04-27 13:45:42,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {3681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:42,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {3689#(<= ~counter~0 0)} assume true; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:42,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3689#(<= ~counter~0 0)} {3681#true} #92#return; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:42,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {3689#(<= ~counter~0 0)} call #t~ret7 := main(); {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:42,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {3689#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:42,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {3689#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {3705#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,233 INFO L272 TraceCheckUtils]: 8: Hoare triple {3705#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,234 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3705#(<= ~counter~0 1)} {3705#(<= ~counter~0 1)} #78#return; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,235 INFO L272 TraceCheckUtils]: 13: Hoare triple {3705#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,236 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3705#(<= ~counter~0 1)} {3705#(<= ~counter~0 1)} #80#return; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,236 INFO L272 TraceCheckUtils]: 18: Hoare triple {3705#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,238 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3705#(<= ~counter~0 1)} {3705#(<= ~counter~0 1)} #82#return; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {3705#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:42,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {3705#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {3760#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,239 INFO L272 TraceCheckUtils]: 26: Hoare triple {3760#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,241 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3760#(<= ~counter~0 2)} {3760#(<= ~counter~0 2)} #78#return; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,241 INFO L272 TraceCheckUtils]: 31: Hoare triple {3760#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,242 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3760#(<= ~counter~0 2)} {3760#(<= ~counter~0 2)} #80#return; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,243 INFO L272 TraceCheckUtils]: 36: Hoare triple {3760#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,244 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3760#(<= ~counter~0 2)} {3760#(<= ~counter~0 2)} #82#return; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {3760#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:45:42,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {3760#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3815#(<= |main_#t~post6| 2)} is VALID [2022-04-27 13:45:42,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {3815#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {3682#false} is VALID [2022-04-27 13:45:42,245 INFO L272 TraceCheckUtils]: 44: Hoare triple {3682#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3682#false} is VALID [2022-04-27 13:45:42,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-27 13:45:42,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {3682#false} assume !(0 == ~cond); {3682#false} is VALID [2022-04-27 13:45:42,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {3682#false} assume true; {3682#false} is VALID [2022-04-27 13:45:42,246 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3682#false} {3682#false} #88#return; {3682#false} is VALID [2022-04-27 13:45:42,246 INFO L272 TraceCheckUtils]: 49: Hoare triple {3682#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3682#false} is VALID [2022-04-27 13:45:42,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-27 13:45:42,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2022-04-27 13:45:42,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2022-04-27 13:45:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 13:45:42,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:45:42,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2022-04-27 13:45:42,467 INFO L290 TraceCheckUtils]: 51: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2022-04-27 13:45:42,467 INFO L290 TraceCheckUtils]: 50: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-27 13:45:42,467 INFO L272 TraceCheckUtils]: 49: Hoare triple {3682#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3682#false} is VALID [2022-04-27 13:45:42,467 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3681#true} {3682#false} #88#return; {3682#false} is VALID [2022-04-27 13:45:42,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:45:42,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:45:42,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:45:42,467 INFO L272 TraceCheckUtils]: 44: Hoare triple {3682#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:45:42,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {3873#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {3682#false} is VALID [2022-04-27 13:45:42,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {3877#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3873#(< |main_#t~post6| 20)} is VALID [2022-04-27 13:45:42,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {3877#(< ~counter~0 20)} assume !(~r~0 >= ~d~0); {3877#(< ~counter~0 20)} is VALID [2022-04-27 13:45:42,474 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3681#true} {3877#(< ~counter~0 20)} #82#return; {3877#(< ~counter~0 20)} is VALID [2022-04-27 13:45:42,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:45:42,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:45:42,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:45:42,474 INFO L272 TraceCheckUtils]: 36: Hoare triple {3877#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:45:42,475 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3681#true} {3877#(< ~counter~0 20)} #80#return; {3877#(< ~counter~0 20)} is VALID [2022-04-27 13:45:42,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:45:42,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:45:42,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:45:42,475 INFO L272 TraceCheckUtils]: 31: Hoare triple {3877#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:45:42,476 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3681#true} {3877#(< ~counter~0 20)} #78#return; {3877#(< ~counter~0 20)} is VALID [2022-04-27 13:45:42,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:45:42,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:45:42,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:45:42,476 INFO L272 TraceCheckUtils]: 26: Hoare triple {3877#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:45:42,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {3877#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {3877#(< ~counter~0 20)} is VALID [2022-04-27 13:45:42,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {3932#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3877#(< ~counter~0 20)} is VALID [2022-04-27 13:45:42,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {3932#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3932#(< ~counter~0 19)} is VALID [2022-04-27 13:45:42,478 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3681#true} {3932#(< ~counter~0 19)} #82#return; {3932#(< ~counter~0 19)} is VALID [2022-04-27 13:45:42,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:45:42,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:45:42,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:45:42,478 INFO L272 TraceCheckUtils]: 18: Hoare triple {3932#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:45:42,479 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3681#true} {3932#(< ~counter~0 19)} #80#return; {3932#(< ~counter~0 19)} is VALID [2022-04-27 13:45:42,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:45:42,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:45:42,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:45:42,479 INFO L272 TraceCheckUtils]: 13: Hoare triple {3932#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:45:42,482 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3681#true} {3932#(< ~counter~0 19)} #78#return; {3932#(< ~counter~0 19)} is VALID [2022-04-27 13:45:42,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:45:42,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:45:42,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:45:42,483 INFO L272 TraceCheckUtils]: 8: Hoare triple {3932#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:45:42,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {3932#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {3932#(< ~counter~0 19)} is VALID [2022-04-27 13:45:42,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {3987#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3932#(< ~counter~0 19)} is VALID [2022-04-27 13:45:42,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {3987#(< ~counter~0 18)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3987#(< ~counter~0 18)} is VALID [2022-04-27 13:45:42,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {3987#(< ~counter~0 18)} call #t~ret7 := main(); {3987#(< ~counter~0 18)} is VALID [2022-04-27 13:45:42,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3987#(< ~counter~0 18)} {3681#true} #92#return; {3987#(< ~counter~0 18)} is VALID [2022-04-27 13:45:42,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {3987#(< ~counter~0 18)} assume true; {3987#(< ~counter~0 18)} is VALID [2022-04-27 13:45:42,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {3681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3987#(< ~counter~0 18)} is VALID [2022-04-27 13:45:42,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2022-04-27 13:45:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 13:45:42,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:42,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657880658] [2022-04-27 13:45:42,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:45:42,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921277324] [2022-04-27 13:45:42,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921277324] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:45:42,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:45:42,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:45:42,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845367527] [2022-04-27 13:45:42,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:45:42,491 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 53 [2022-04-27 13:45:42,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:42,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:45:42,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:42,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:45:42,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:42,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:45:42,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:45:42,551 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:45:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:43,017 INFO L93 Difference]: Finished difference Result 245 states and 298 transitions. [2022-04-27 13:45:43,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 13:45:43,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 53 [2022-04-27 13:45:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:45:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-27 13:45:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:45:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-27 13:45:43,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-27 13:45:43,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:43,125 INFO L225 Difference]: With dead ends: 245 [2022-04-27 13:45:43,125 INFO L226 Difference]: Without dead ends: 224 [2022-04-27 13:45:43,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 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:45:43,126 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 100 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:43,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 222 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:45:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-27 13:45:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 217. [2022-04-27 13:45:43,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:43,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 217 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 51 states have call successors, (51), 28 states have call predecessors, (51), 26 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 13:45:43,200 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 217 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 51 states have call successors, (51), 28 states have call predecessors, (51), 26 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 13:45:43,200 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 217 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 51 states have call successors, (51), 28 states have call predecessors, (51), 26 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 13:45:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:43,204 INFO L93 Difference]: Finished difference Result 224 states and 267 transitions. [2022-04-27 13:45:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 267 transitions. [2022-04-27 13:45:43,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:43,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:43,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 51 states have call successors, (51), 28 states have call predecessors, (51), 26 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) Second operand 224 states. [2022-04-27 13:45:43,206 INFO L87 Difference]: Start difference. First operand has 217 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 51 states have call successors, (51), 28 states have call predecessors, (51), 26 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) Second operand 224 states. [2022-04-27 13:45:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:43,210 INFO L93 Difference]: Finished difference Result 224 states and 267 transitions. [2022-04-27 13:45:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 267 transitions. [2022-04-27 13:45:43,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:43,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:43,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:43,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 51 states have call successors, (51), 28 states have call predecessors, (51), 26 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 13:45:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 263 transitions. [2022-04-27 13:45:43,215 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 263 transitions. Word has length 53 [2022-04-27 13:45:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:43,215 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 263 transitions. [2022-04-27 13:45:43,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:45:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 263 transitions. [2022-04-27 13:45:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-27 13:45:43,216 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:43,216 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] [2022-04-27 13:45:43,233 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:45:43,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:43,434 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:43,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 1 times [2022-04-27 13:45:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:43,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532932320] [2022-04-27 13:45:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:43,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:43,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:43,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1407930207] [2022-04-27 13:45:43,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:43,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:43,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:43,445 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:45:43,446 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:45:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:43,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 13:45:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:43,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:45:43,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {5104#true} call ULTIMATE.init(); {5104#true} is VALID [2022-04-27 13:45:43,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {5104#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5104#true} is VALID [2022-04-27 13:45:43,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:43,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5104#true} {5104#true} #92#return; {5104#true} is VALID [2022-04-27 13:45:43,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {5104#true} call #t~ret7 := main(); {5104#true} is VALID [2022-04-27 13:45:43,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {5104#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:43,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:43,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:43,917 INFO L272 TraceCheckUtils]: 8: Hoare triple {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:43,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:43,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:43,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:43,917 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5104#true} {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:43,918 INFO L272 TraceCheckUtils]: 13: Hoare triple {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:43,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:43,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:43,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:43,918 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5104#true} {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:43,918 INFO L272 TraceCheckUtils]: 18: Hoare triple {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:43,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:43,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:43,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:43,919 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5104#true} {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:43,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:43,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:43,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:43,921 INFO L272 TraceCheckUtils]: 26: Hoare triple {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:43,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:43,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:43,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:43,922 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5104#true} {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:43,922 INFO L272 TraceCheckUtils]: 31: Hoare triple {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:43,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:43,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:43,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:43,923 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5104#true} {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:43,923 INFO L272 TraceCheckUtils]: 36: Hoare triple {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:43,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:43,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:43,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:43,923 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5104#true} {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:43,924 INFO L290 TraceCheckUtils]: 41: Hoare triple {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:43,924 INFO L290 TraceCheckUtils]: 42: Hoare triple {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:43,924 INFO L290 TraceCheckUtils]: 43: Hoare triple {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:43,924 INFO L272 TraceCheckUtils]: 44: Hoare triple {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:43,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:43,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:43,925 INFO L290 TraceCheckUtils]: 47: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:43,925 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5104#true} {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:43,925 INFO L272 TraceCheckUtils]: 49: Hoare triple {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:43,925 INFO L290 TraceCheckUtils]: 50: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:43,925 INFO L290 TraceCheckUtils]: 51: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:43,925 INFO L290 TraceCheckUtils]: 52: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:43,926 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5104#true} {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #86#return; {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:43,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {5179#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~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); {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:43,927 INFO L290 TraceCheckUtils]: 55: Hoare triple {5124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5276#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:45:43,927 INFO L290 TraceCheckUtils]: 56: Hoare triple {5276#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5276#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:45:43,927 INFO L290 TraceCheckUtils]: 57: Hoare triple {5276#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {5276#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:45:43,928 INFO L272 TraceCheckUtils]: 58: Hoare triple {5276#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5286#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:45:43,928 INFO L290 TraceCheckUtils]: 59: Hoare triple {5286#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:45:43,928 INFO L290 TraceCheckUtils]: 60: Hoare triple {5290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5105#false} is VALID [2022-04-27 13:45:43,928 INFO L290 TraceCheckUtils]: 61: Hoare triple {5105#false} assume !false; {5105#false} is VALID [2022-04-27 13:45:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 13:45:43,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:45:45,040 INFO L290 TraceCheckUtils]: 61: Hoare triple {5105#false} assume !false; {5105#false} is VALID [2022-04-27 13:45:45,040 INFO L290 TraceCheckUtils]: 60: Hoare triple {5290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5105#false} is VALID [2022-04-27 13:45:45,040 INFO L290 TraceCheckUtils]: 59: Hoare triple {5286#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:45:45,041 INFO L272 TraceCheckUtils]: 58: Hoare triple {5306#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5286#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:45:45,041 INFO L290 TraceCheckUtils]: 57: Hoare triple {5306#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 20);havoc #t~post6; {5306#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:45:45,042 INFO L290 TraceCheckUtils]: 56: Hoare triple {5306#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5306#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:45:45,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5306#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:45:45,076 INFO L290 TraceCheckUtils]: 54: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:45:45,077 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5104#true} {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 13:45:45,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:45,077 INFO L290 TraceCheckUtils]: 51: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:45,077 INFO L290 TraceCheckUtils]: 50: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:45,077 INFO L272 TraceCheckUtils]: 49: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:45,078 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5104#true} {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 13:45:45,078 INFO L290 TraceCheckUtils]: 47: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:45,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:45,078 INFO L290 TraceCheckUtils]: 45: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:45,078 INFO L272 TraceCheckUtils]: 44: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:45,079 INFO L290 TraceCheckUtils]: 43: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post6 < 20);havoc #t~post6; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 13:45:45,081 INFO L290 TraceCheckUtils]: 42: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 13:45:45,081 INFO L290 TraceCheckUtils]: 41: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !(~r~0 >= ~d~0); {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 13:45:45,082 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5104#true} {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #82#return; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 13:45:45,082 INFO L290 TraceCheckUtils]: 39: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:45,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:45,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:45,083 INFO L272 TraceCheckUtils]: 36: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:45,083 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5104#true} {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #80#return; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 13:45:45,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:45,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:45,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:45,084 INFO L272 TraceCheckUtils]: 31: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:45,084 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5104#true} {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #78#return; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 13:45:45,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:45,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:45,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:45,085 INFO L272 TraceCheckUtils]: 26: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:45,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post5 < 20);havoc #t~post5; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 13:45:45,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 13:45:45,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-27 13:45:45,094 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5104#true} {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #82#return; {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:45:45,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:45,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:45,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:45,094 INFO L272 TraceCheckUtils]: 18: Hoare triple {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:45,095 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5104#true} {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #80#return; {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:45:45,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:45,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:45,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:45,095 INFO L272 TraceCheckUtils]: 13: Hoare triple {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:45,095 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5104#true} {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #78#return; {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:45:45,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:45,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:45:45,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:45:45,096 INFO L272 TraceCheckUtils]: 8: Hoare triple {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5104#true} is VALID [2022-04-27 13:45:45,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:45:45,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:45:45,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {5104#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:45:45,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {5104#true} call #t~ret7 := main(); {5104#true} is VALID [2022-04-27 13:45:45,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5104#true} {5104#true} #92#return; {5104#true} is VALID [2022-04-27 13:45:45,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:45:45,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {5104#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5104#true} is VALID [2022-04-27 13:45:45,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {5104#true} call ULTIMATE.init(); {5104#true} is VALID [2022-04-27 13:45:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 13:45:45,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:45,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532932320] [2022-04-27 13:45:45,110 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:45:45,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407930207] [2022-04-27 13:45:45,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407930207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:45:45,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:45:45,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 13:45:45,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82993269] [2022-04-27 13:45:45,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:45:45,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 62 [2022-04-27 13:45:45,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:45,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:45:45,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:45,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:45:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:45,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:45:45,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:45:45,227 INFO L87 Difference]: Start difference. First operand 217 states and 263 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:45:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:48,477 INFO L93 Difference]: Finished difference Result 371 states and 479 transitions. [2022-04-27 13:45:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:45:48,478 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 62 [2022-04-27 13:45:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:45:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2022-04-27 13:45:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:45:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2022-04-27 13:45:48,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 153 transitions. [2022-04-27 13:45:48,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:48,713 INFO L225 Difference]: With dead ends: 371 [2022-04-27 13:45:48,714 INFO L226 Difference]: Without dead ends: 303 [2022-04-27 13:45:48,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:45:48,714 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 52 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:48,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 204 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 13:45:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-27 13:45:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 274. [2022-04-27 13:45:48,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:48,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 274 states, 185 states have (on average 1.2324324324324325) internal successors, (228), 191 states have internal predecessors, (228), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:45:48,818 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 274 states, 185 states have (on average 1.2324324324324325) internal successors, (228), 191 states have internal predecessors, (228), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:45:48,818 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 274 states, 185 states have (on average 1.2324324324324325) internal successors, (228), 191 states have internal predecessors, (228), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:45:48,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:48,824 INFO L93 Difference]: Finished difference Result 303 states and 382 transitions. [2022-04-27 13:45:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 382 transitions. [2022-04-27 13:45:48,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:48,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:48,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 274 states, 185 states have (on average 1.2324324324324325) internal successors, (228), 191 states have internal predecessors, (228), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) Second operand 303 states. [2022-04-27 13:45:48,826 INFO L87 Difference]: Start difference. First operand has 274 states, 185 states have (on average 1.2324324324324325) internal successors, (228), 191 states have internal predecessors, (228), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) Second operand 303 states. [2022-04-27 13:45:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:48,831 INFO L93 Difference]: Finished difference Result 303 states and 382 transitions. [2022-04-27 13:45:48,831 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 382 transitions. [2022-04-27 13:45:48,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:48,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:48,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:48,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 185 states have (on average 1.2324324324324325) internal successors, (228), 191 states have internal predecessors, (228), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:45:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 341 transitions. [2022-04-27 13:45:48,838 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 341 transitions. Word has length 62 [2022-04-27 13:45:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:48,838 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 341 transitions. [2022-04-27 13:45:48,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:45:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 341 transitions. [2022-04-27 13:45:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 13:45:48,839 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:48,839 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] [2022-04-27 13:45:48,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 13:45:49,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:49,056 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:49,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 1 times [2022-04-27 13:45:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:49,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6339458] [2022-04-27 13:45:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:49,068 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:49,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899755659] [2022-04-27 13:45:49,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:49,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:49,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:49,070 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:45:49,071 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:45:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:49,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 13:45:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:49,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:45:49,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {6981#true} call ULTIMATE.init(); {6981#true} is VALID [2022-04-27 13:45:49,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {6981#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6981#true} is VALID [2022-04-27 13:45:49,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:45:49,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6981#true} {6981#true} #92#return; {6981#true} is VALID [2022-04-27 13:45:49,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {6981#true} call #t~ret7 := main(); {6981#true} is VALID [2022-04-27 13:45:49,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {6981#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:49,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:49,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:49,774 INFO L272 TraceCheckUtils]: 8: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:45:49,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:45:49,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:45:49,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:45:49,775 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6981#true} {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:49,775 INFO L272 TraceCheckUtils]: 13: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:45:49,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:45:49,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:45:49,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:45:49,776 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6981#true} {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:49,776 INFO L272 TraceCheckUtils]: 18: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:45:49,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:45:49,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:45:49,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:45:49,777 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6981#true} {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:49,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:49,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:49,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:49,778 INFO L272 TraceCheckUtils]: 26: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:45:49,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:45:49,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:45:49,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:45:49,779 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6981#true} {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #78#return; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:49,779 INFO L272 TraceCheckUtils]: 31: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:45:49,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:45:49,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:45:49,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:45:49,779 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6981#true} {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #80#return; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:49,779 INFO L272 TraceCheckUtils]: 36: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:45:49,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:45:49,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:45:49,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:45:49,780 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6981#true} {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #82#return; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:49,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:49,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:49,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:49,781 INFO L272 TraceCheckUtils]: 44: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:45:49,782 INFO L290 TraceCheckUtils]: 45: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:45:49,782 INFO L290 TraceCheckUtils]: 46: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:45:49,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:45:49,782 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6981#true} {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #84#return; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:49,782 INFO L272 TraceCheckUtils]: 49: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:45:49,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:45:49,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:45:49,782 INFO L290 TraceCheckUtils]: 52: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:45:49,783 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6981#true} {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #86#return; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:45:49,783 INFO L290 TraceCheckUtils]: 54: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~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); {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:49,784 INFO L290 TraceCheckUtils]: 55: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:49,785 INFO L290 TraceCheckUtils]: 56: Hoare triple {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:49,785 INFO L290 TraceCheckUtils]: 57: Hoare triple {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:49,785 INFO L272 TraceCheckUtils]: 58: Hoare triple {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:45:49,785 INFO L290 TraceCheckUtils]: 59: Hoare triple {6981#true} ~cond := #in~cond; {7166#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:45:49,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {7166#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:45:49,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:45:49,787 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {7177#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:49,787 INFO L272 TraceCheckUtils]: 63: Hoare triple {7177#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:45:49,787 INFO L290 TraceCheckUtils]: 64: Hoare triple {6981#true} ~cond := #in~cond; {7166#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:45:49,787 INFO L290 TraceCheckUtils]: 65: Hoare triple {7166#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:45:49,788 INFO L290 TraceCheckUtils]: 66: Hoare triple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:45:49,788 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} {7177#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {7193#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:49,789 INFO L290 TraceCheckUtils]: 68: Hoare triple {7193#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} assume !(1 != ~p~0); {7197#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-27 13:45:49,789 INFO L272 TraceCheckUtils]: 69: Hoare triple {7197#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {7201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:45:49,790 INFO L290 TraceCheckUtils]: 70: Hoare triple {7201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:45:49,790 INFO L290 TraceCheckUtils]: 71: Hoare triple {7205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6982#false} is VALID [2022-04-27 13:45:49,790 INFO L290 TraceCheckUtils]: 72: Hoare triple {6982#false} assume !false; {6982#false} is VALID [2022-04-27 13:45:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-27 13:45:49,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:46:00,457 INFO L290 TraceCheckUtils]: 72: Hoare triple {6982#false} assume !false; {6982#false} is VALID [2022-04-27 13:46:00,458 INFO L290 TraceCheckUtils]: 71: Hoare triple {7205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6982#false} is VALID [2022-04-27 13:46:00,458 INFO L290 TraceCheckUtils]: 70: Hoare triple {7201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:46:00,459 INFO L272 TraceCheckUtils]: 69: Hoare triple {7221#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {7201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:46:00,459 INFO L290 TraceCheckUtils]: 68: Hoare triple {7225#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {7221#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:46:00,460 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} {7229#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} #86#return; {7225#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-27 13:46:00,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:46:00,460 INFO L290 TraceCheckUtils]: 65: Hoare triple {7239#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:46:00,461 INFO L290 TraceCheckUtils]: 64: Hoare triple {6981#true} ~cond := #in~cond; {7239#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:46:00,461 INFO L272 TraceCheckUtils]: 63: Hoare triple {7229#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:46:00,463 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} {6981#true} #84#return; {7229#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} is VALID [2022-04-27 13:46:00,463 INFO L290 TraceCheckUtils]: 61: Hoare triple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:46:00,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {7239#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:46:00,464 INFO L290 TraceCheckUtils]: 59: Hoare triple {6981#true} ~cond := #in~cond; {7239#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:46:00,464 INFO L272 TraceCheckUtils]: 58: Hoare triple {6981#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:46:00,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {6981#true} assume !!(#t~post6 < 20);havoc #t~post6; {6981#true} is VALID [2022-04-27 13:46:00,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {6981#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6981#true} is VALID [2022-04-27 13:46:00,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {6981#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6981#true} is VALID [2022-04-27 13:46:00,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {6981#true} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6981#true} is VALID [2022-04-27 13:46:00,465 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6981#true} {6981#true} #86#return; {6981#true} is VALID [2022-04-27 13:46:00,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:46:00,465 INFO L290 TraceCheckUtils]: 51: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:46:00,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:46:00,465 INFO L272 TraceCheckUtils]: 49: Hoare triple {6981#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:46:00,465 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6981#true} {6981#true} #84#return; {6981#true} is VALID [2022-04-27 13:46:00,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:46:00,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:46:00,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:46:00,465 INFO L272 TraceCheckUtils]: 44: Hoare triple {6981#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:46:00,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {6981#true} assume !!(#t~post6 < 20);havoc #t~post6; {6981#true} is VALID [2022-04-27 13:46:00,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {6981#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6981#true} is VALID [2022-04-27 13:46:00,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {6981#true} assume !(~r~0 >= ~d~0); {6981#true} is VALID [2022-04-27 13:46:00,466 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6981#true} {6981#true} #82#return; {6981#true} is VALID [2022-04-27 13:46:00,466 INFO L290 TraceCheckUtils]: 39: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:46:00,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:46:00,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:46:00,466 INFO L272 TraceCheckUtils]: 36: Hoare triple {6981#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:46:00,466 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6981#true} {6981#true} #80#return; {6981#true} is VALID [2022-04-27 13:46:00,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:46:00,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:46:00,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:46:00,466 INFO L272 TraceCheckUtils]: 31: Hoare triple {6981#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:46:00,466 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6981#true} {6981#true} #78#return; {6981#true} is VALID [2022-04-27 13:46:00,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:46:00,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:46:00,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:46:00,467 INFO L272 TraceCheckUtils]: 26: Hoare triple {6981#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:46:00,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {6981#true} assume !!(#t~post5 < 20);havoc #t~post5; {6981#true} is VALID [2022-04-27 13:46:00,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {6981#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6981#true} is VALID [2022-04-27 13:46:00,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {6981#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6981#true} is VALID [2022-04-27 13:46:00,467 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6981#true} {6981#true} #82#return; {6981#true} is VALID [2022-04-27 13:46:00,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:46:00,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:46:00,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:46:00,467 INFO L272 TraceCheckUtils]: 18: Hoare triple {6981#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:46:00,467 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6981#true} {6981#true} #80#return; {6981#true} is VALID [2022-04-27 13:46:00,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:46:00,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:46:00,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:46:00,468 INFO L272 TraceCheckUtils]: 13: Hoare triple {6981#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:46:00,468 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6981#true} {6981#true} #78#return; {6981#true} is VALID [2022-04-27 13:46:00,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:46:00,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:46:00,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:46:00,468 INFO L272 TraceCheckUtils]: 8: Hoare triple {6981#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:46:00,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {6981#true} assume !!(#t~post5 < 20);havoc #t~post5; {6981#true} is VALID [2022-04-27 13:46:00,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {6981#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6981#true} is VALID [2022-04-27 13:46:00,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {6981#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {6981#true} is VALID [2022-04-27 13:46:00,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {6981#true} call #t~ret7 := main(); {6981#true} is VALID [2022-04-27 13:46:00,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6981#true} {6981#true} #92#return; {6981#true} is VALID [2022-04-27 13:46:00,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:46:00,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {6981#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6981#true} is VALID [2022-04-27 13:46:00,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {6981#true} call ULTIMATE.init(); {6981#true} is VALID [2022-04-27 13:46:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-04-27 13:46:00,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:46:00,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6339458] [2022-04-27 13:46:00,469 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:46:00,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899755659] [2022-04-27 13:46:00,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899755659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:46:00,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:46:00,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-27 13:46:00,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823524952] [2022-04-27 13:46:00,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:46:00,470 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 73 [2022-04-27 13:46:00,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:46:00,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:46:00,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:46:00,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:46:00,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:46:00,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:46:00,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:46:00,536 INFO L87 Difference]: Start difference. First operand 274 states and 341 transitions. Second operand has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:46:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:46:01,775 INFO L93 Difference]: Finished difference Result 335 states and 416 transitions. [2022-04-27 13:46:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 13:46:01,775 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 73 [2022-04-27 13:46:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:46:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:46:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-27 13:46:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:46:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-27 13:46:01,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 126 transitions. [2022-04-27 13:46:01,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:46:01,887 INFO L225 Difference]: With dead ends: 335 [2022-04-27 13:46:01,888 INFO L226 Difference]: Without dead ends: 239 [2022-04-27 13:46:01,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:46:01,889 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 53 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:46:01,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 167 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 13:46:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-27 13:46:01,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 223. [2022-04-27 13:46:01,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:46:01,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 223 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 154 states have internal predecessors, (179), 45 states have call successors, (45), 29 states have call predecessors, (45), 27 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:46:01,956 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 223 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 154 states have internal predecessors, (179), 45 states have call successors, (45), 29 states have call predecessors, (45), 27 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:46:01,956 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 223 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 154 states have internal predecessors, (179), 45 states have call successors, (45), 29 states have call predecessors, (45), 27 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:46:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:46:01,961 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2022-04-27 13:46:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-04-27 13:46:01,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:46:01,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:46:01,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 154 states have internal predecessors, (179), 45 states have call successors, (45), 29 states have call predecessors, (45), 27 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) Second operand 239 states. [2022-04-27 13:46:01,962 INFO L87 Difference]: Start difference. First operand has 223 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 154 states have internal predecessors, (179), 45 states have call successors, (45), 29 states have call predecessors, (45), 27 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) Second operand 239 states. [2022-04-27 13:46:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:46:01,966 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2022-04-27 13:46:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-04-27 13:46:01,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:46:01,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:46:01,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:46:01,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:46:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 154 states have internal predecessors, (179), 45 states have call successors, (45), 29 states have call predecessors, (45), 27 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:46:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2022-04-27 13:46:01,972 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 73 [2022-04-27 13:46:01,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:46:01,972 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2022-04-27 13:46:01,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:46:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2022-04-27 13:46:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 13:46:01,973 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:46:01,973 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] [2022-04-27 13:46:01,990 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:46:02,187 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,SelfDestructingSolverStorable11 [2022-04-27 13:46:02,187 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:46:02,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:46:02,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1894150768, now seen corresponding path program 1 times [2022-04-27 13:46:02,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:46:02,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627694611] [2022-04-27 13:46:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:46:02,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:46:02,202 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:46:02,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1441543584] [2022-04-27 13:46:02,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:46:02,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:46:02,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:46:02,203 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:46:02,204 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:46:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:46:02,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:46:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:46:02,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:46:03,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {8676#true} call ULTIMATE.init(); {8676#true} is VALID [2022-04-27 13:46:03,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {8676#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8676#true} is VALID [2022-04-27 13:46:03,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:46:03,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8676#true} {8676#true} #92#return; {8676#true} is VALID [2022-04-27 13:46:03,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {8676#true} call #t~ret7 := main(); {8676#true} is VALID [2022-04-27 13:46:03,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {8676#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {8696#(<= 1 main_~p~0)} is VALID [2022-04-27 13:46:03,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {8696#(<= 1 main_~p~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8696#(<= 1 main_~p~0)} is VALID [2022-04-27 13:46:03,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {8696#(<= 1 main_~p~0)} assume !!(#t~post5 < 20);havoc #t~post5; {8696#(<= 1 main_~p~0)} is VALID [2022-04-27 13:46:03,414 INFO L272 TraceCheckUtils]: 8: Hoare triple {8696#(<= 1 main_~p~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:46:03,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:46:03,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:46:03,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:46:03,414 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8676#true} {8696#(<= 1 main_~p~0)} #78#return; {8696#(<= 1 main_~p~0)} is VALID [2022-04-27 13:46:03,414 INFO L272 TraceCheckUtils]: 13: Hoare triple {8696#(<= 1 main_~p~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:46:03,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:46:03,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:46:03,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:46:03,415 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8676#true} {8696#(<= 1 main_~p~0)} #80#return; {8696#(<= 1 main_~p~0)} is VALID [2022-04-27 13:46:03,415 INFO L272 TraceCheckUtils]: 18: Hoare triple {8696#(<= 1 main_~p~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:46:03,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:46:03,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:46:03,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:46:03,426 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8676#true} {8696#(<= 1 main_~p~0)} #82#return; {8696#(<= 1 main_~p~0)} is VALID [2022-04-27 13:46:03,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {8696#(<= 1 main_~p~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8751#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:46:03,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {8751#(<= 1 (div main_~p~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8751#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:46:03,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {8751#(<= 1 (div main_~p~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8751#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:46:03,427 INFO L272 TraceCheckUtils]: 26: Hoare triple {8751#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:46:03,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:46:03,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:46:03,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:46:03,428 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {8676#true} {8751#(<= 1 (div main_~p~0 2))} #78#return; {8751#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:46:03,428 INFO L272 TraceCheckUtils]: 31: Hoare triple {8751#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:46:03,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:46:03,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:46:03,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:46:03,428 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8676#true} {8751#(<= 1 (div main_~p~0 2))} #80#return; {8751#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:46:03,428 INFO L272 TraceCheckUtils]: 36: Hoare triple {8751#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:46:03,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:46:03,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:46:03,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:46:03,429 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8676#true} {8751#(<= 1 (div main_~p~0 2))} #82#return; {8751#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:46:03,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {8751#(<= 1 (div main_~p~0 2))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:46:03,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:46:03,430 INFO L290 TraceCheckUtils]: 43: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:46:03,430 INFO L272 TraceCheckUtils]: 44: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:46:03,430 INFO L290 TraceCheckUtils]: 45: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:46:03,430 INFO L290 TraceCheckUtils]: 46: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:46:03,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:46:03,431 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8676#true} {8806#(<= 1 (div (div main_~p~0 2) 2))} #78#return; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:46:03,431 INFO L272 TraceCheckUtils]: 49: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:46:03,431 INFO L290 TraceCheckUtils]: 50: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:46:03,431 INFO L290 TraceCheckUtils]: 51: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:46:03,431 INFO L290 TraceCheckUtils]: 52: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:46:03,431 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8676#true} {8806#(<= 1 (div (div main_~p~0 2) 2))} #80#return; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:46:03,431 INFO L272 TraceCheckUtils]: 54: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:46:03,431 INFO L290 TraceCheckUtils]: 55: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:46:03,432 INFO L290 TraceCheckUtils]: 56: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:46:03,432 INFO L290 TraceCheckUtils]: 57: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:46:03,432 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8676#true} {8806#(<= 1 (div (div main_~p~0 2) 2))} #82#return; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:46:03,432 INFO L290 TraceCheckUtils]: 59: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} assume !(~r~0 >= ~d~0); {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:46:03,432 INFO L290 TraceCheckUtils]: 60: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:46:03,433 INFO L290 TraceCheckUtils]: 61: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} assume !!(#t~post6 < 20);havoc #t~post6; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:46:03,433 INFO L272 TraceCheckUtils]: 62: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:46:03,433 INFO L290 TraceCheckUtils]: 63: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:46:03,433 INFO L290 TraceCheckUtils]: 64: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:46:03,433 INFO L290 TraceCheckUtils]: 65: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:46:03,433 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8676#true} {8806#(<= 1 (div (div main_~p~0 2) 2))} #84#return; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:46:03,433 INFO L272 TraceCheckUtils]: 67: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:46:03,434 INFO L290 TraceCheckUtils]: 68: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:46:03,434 INFO L290 TraceCheckUtils]: 69: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:46:03,434 INFO L290 TraceCheckUtils]: 70: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:46:03,434 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8676#true} {8806#(<= 1 (div (div main_~p~0 2) 2))} #86#return; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:46:03,434 INFO L290 TraceCheckUtils]: 72: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} assume !(1 != ~p~0); {8677#false} is VALID [2022-04-27 13:46:03,434 INFO L272 TraceCheckUtils]: 73: Hoare triple {8677#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {8677#false} is VALID [2022-04-27 13:46:03,434 INFO L290 TraceCheckUtils]: 74: Hoare triple {8677#false} ~cond := #in~cond; {8677#false} is VALID [2022-04-27 13:46:03,435 INFO L290 TraceCheckUtils]: 75: Hoare triple {8677#false} assume !(0 == ~cond); {8677#false} is VALID [2022-04-27 13:46:03,435 INFO L290 TraceCheckUtils]: 76: Hoare triple {8677#false} assume true; {8677#false} is VALID [2022-04-27 13:46:03,435 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8677#false} {8677#false} #88#return; {8677#false} is VALID [2022-04-27 13:46:03,435 INFO L272 TraceCheckUtils]: 78: Hoare triple {8677#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {8677#false} is VALID [2022-04-27 13:46:03,435 INFO L290 TraceCheckUtils]: 79: Hoare triple {8677#false} ~cond := #in~cond; {8677#false} is VALID [2022-04-27 13:46:03,435 INFO L290 TraceCheckUtils]: 80: Hoare triple {8677#false} assume 0 == ~cond; {8677#false} is VALID [2022-04-27 13:46:03,435 INFO L290 TraceCheckUtils]: 81: Hoare triple {8677#false} assume !false; {8677#false} is VALID [2022-04-27 13:46:03,435 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:46:03,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:46:03,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:46:03,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627694611] [2022-04-27 13:46:03,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:46:03,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441543584] [2022-04-27 13:46:03,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441543584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:46:03,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:46:03,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:46:03,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329239053] [2022-04-27 13:46:03,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:46:03,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 82 [2022-04-27 13:46:03,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:46:03,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 13:46:03,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:46:03,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:46:03,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:46:03,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:46:03,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:46:03,472 INFO L87 Difference]: Start difference. First operand 223 states and 266 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 13:46:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:46:03,707 INFO L93 Difference]: Finished difference Result 242 states and 289 transitions. [2022-04-27 13:46:03,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:46:03,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 82 [2022-04-27 13:46:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:46:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 13:46:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-04-27 13:46:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 13:46:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-04-27 13:46:03,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 88 transitions. [2022-04-27 13:46:03,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:46:03,782 INFO L225 Difference]: With dead ends: 242 [2022-04-27 13:46:03,782 INFO L226 Difference]: Without dead ends: 222 [2022-04-27 13:46:03,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 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:46:03,782 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 25 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:46:03,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:46:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-27 13:46:03,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2022-04-27 13:46:03,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:46:03,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 217 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 43 states have call successors, (43), 27 states have call predecessors, (43), 26 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:46:03,866 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 217 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 43 states have call successors, (43), 27 states have call predecessors, (43), 26 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:46:03,866 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 217 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 43 states have call successors, (43), 27 states have call predecessors, (43), 26 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:46:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:46:03,870 INFO L93 Difference]: Finished difference Result 222 states and 263 transitions. [2022-04-27 13:46:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2022-04-27 13:46:03,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:46:03,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:46:03,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 43 states have call successors, (43), 27 states have call predecessors, (43), 26 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand 222 states. [2022-04-27 13:46:03,871 INFO L87 Difference]: Start difference. First operand has 217 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 43 states have call successors, (43), 27 states have call predecessors, (43), 26 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand 222 states. [2022-04-27 13:46:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:46:03,875 INFO L93 Difference]: Finished difference Result 222 states and 263 transitions. [2022-04-27 13:46:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2022-04-27 13:46:03,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:46:03,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:46:03,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:46:03,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:46:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 43 states have call successors, (43), 27 states have call predecessors, (43), 26 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:46:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 255 transitions. [2022-04-27 13:46:03,879 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 255 transitions. Word has length 82 [2022-04-27 13:46:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:46:03,880 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 255 transitions. [2022-04-27 13:46:03,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 13:46:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 255 transitions. [2022-04-27 13:46:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-27 13:46:03,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:46:03,880 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] [2022-04-27 13:46:03,898 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:46:04,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 13:46:04,098 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:46:04,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:46:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 2 times [2022-04-27 13:46:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:46:04,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723966831] [2022-04-27 13:46:04,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:46:04,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:46:04,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:46:04,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735913973] [2022-04-27 13:46:04,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:46:04,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:46:04,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:46:04,110 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:46:04,111 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:46:04,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:46:04,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:46:04,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 13:46:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:46:04,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:46:04,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {9994#true} call ULTIMATE.init(); {9994#true} is VALID [2022-04-27 13:46:04,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {9994#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9994#true} is VALID [2022-04-27 13:46:04,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9994#true} {9994#true} #92#return; {9994#true} is VALID [2022-04-27 13:46:04,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {9994#true} call #t~ret7 := main(); {9994#true} is VALID [2022-04-27 13:46:04,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {9994#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:46:04,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:46:04,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:46:04,834 INFO L272 TraceCheckUtils]: 8: Hoare triple {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:04,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:04,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:04,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,834 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9994#true} {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:46:04,835 INFO L272 TraceCheckUtils]: 13: Hoare triple {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:04,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:04,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:04,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,837 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9994#true} {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:46:04,837 INFO L272 TraceCheckUtils]: 18: Hoare triple {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:04,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:04,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:04,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,838 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9994#true} {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:46:04,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {10014#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:46:04,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:46:04,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:46:04,839 INFO L272 TraceCheckUtils]: 26: Hoare triple {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:04,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:04,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:04,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,840 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9994#true} {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:46:04,840 INFO L272 TraceCheckUtils]: 31: Hoare triple {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:04,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:04,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:04,840 INFO L290 TraceCheckUtils]: 34: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,840 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9994#true} {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:46:04,840 INFO L272 TraceCheckUtils]: 36: Hoare triple {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:04,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:04,841 INFO L290 TraceCheckUtils]: 38: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:04,841 INFO L290 TraceCheckUtils]: 39: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,841 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9994#true} {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:46:04,842 INFO L290 TraceCheckUtils]: 41: Hoare triple {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-27 13:46:04,842 INFO L290 TraceCheckUtils]: 42: Hoare triple {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-27 13:46:04,842 INFO L290 TraceCheckUtils]: 43: Hoare triple {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-27 13:46:04,842 INFO L272 TraceCheckUtils]: 44: Hoare triple {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:04,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:04,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:04,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,843 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9994#true} {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #78#return; {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-27 13:46:04,843 INFO L272 TraceCheckUtils]: 49: Hoare triple {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:04,843 INFO L290 TraceCheckUtils]: 50: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:04,843 INFO L290 TraceCheckUtils]: 51: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:04,843 INFO L290 TraceCheckUtils]: 52: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,844 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9994#true} {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #80#return; {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-27 13:46:04,844 INFO L272 TraceCheckUtils]: 54: Hoare triple {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:04,844 INFO L290 TraceCheckUtils]: 55: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:04,844 INFO L290 TraceCheckUtils]: 56: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:04,844 INFO L290 TraceCheckUtils]: 57: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,845 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9994#true} {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #82#return; {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-27 13:46:04,845 INFO L290 TraceCheckUtils]: 59: Hoare triple {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-27 13:46:04,845 INFO L290 TraceCheckUtils]: 60: Hoare triple {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-27 13:46:04,846 INFO L290 TraceCheckUtils]: 61: Hoare triple {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !!(#t~post6 < 20);havoc #t~post6; {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-27 13:46:04,846 INFO L272 TraceCheckUtils]: 62: Hoare triple {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:04,846 INFO L290 TraceCheckUtils]: 63: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:04,846 INFO L290 TraceCheckUtils]: 64: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:04,846 INFO L290 TraceCheckUtils]: 65: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,847 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9994#true} {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #84#return; {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-27 13:46:04,847 INFO L272 TraceCheckUtils]: 67: Hoare triple {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:04,847 INFO L290 TraceCheckUtils]: 68: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:04,847 INFO L290 TraceCheckUtils]: 69: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:04,847 INFO L290 TraceCheckUtils]: 70: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,848 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9994#true} {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #86#return; {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-27 13:46:04,848 INFO L290 TraceCheckUtils]: 72: Hoare triple {10124#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= 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); {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-27 13:46:04,849 INFO L290 TraceCheckUtils]: 73: Hoare triple {10069#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-27 13:46:04,849 INFO L290 TraceCheckUtils]: 74: Hoare triple {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-27 13:46:04,849 INFO L290 TraceCheckUtils]: 75: Hoare triple {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-27 13:46:04,849 INFO L272 TraceCheckUtils]: 76: Hoare triple {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:04,849 INFO L290 TraceCheckUtils]: 77: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:04,850 INFO L290 TraceCheckUtils]: 78: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:04,850 INFO L290 TraceCheckUtils]: 79: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,850 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9994#true} {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #84#return; {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-27 13:46:04,850 INFO L272 TraceCheckUtils]: 81: Hoare triple {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:04,850 INFO L290 TraceCheckUtils]: 82: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:04,850 INFO L290 TraceCheckUtils]: 83: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:04,850 INFO L290 TraceCheckUtils]: 84: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:04,851 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {9994#true} {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #86#return; {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-27 13:46:04,851 INFO L290 TraceCheckUtils]: 86: Hoare triple {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~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); {10261#(and (= (+ (* (- 2) main_~B~0) main_~A~0) main_~r~0) (= (+ (- 2) main_~q~0) 0) (= (div (* main_~B~0 2) 2) main_~d~0) (= main_~B~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:46:04,852 INFO L290 TraceCheckUtils]: 87: Hoare triple {10261#(and (= (+ (* (- 2) main_~B~0) main_~A~0) main_~r~0) (= (+ (- 2) main_~q~0) 0) (= (div (* main_~B~0 2) 2) main_~d~0) (= main_~B~0 1) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10265#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-27 13:46:04,853 INFO L290 TraceCheckUtils]: 88: Hoare triple {10265#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10265#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-27 13:46:04,853 INFO L290 TraceCheckUtils]: 89: Hoare triple {10265#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {10265#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-27 13:46:04,854 INFO L272 TraceCheckUtils]: 90: Hoare triple {10265#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10275#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:46:04,854 INFO L290 TraceCheckUtils]: 91: Hoare triple {10275#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10279#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:46:04,854 INFO L290 TraceCheckUtils]: 92: Hoare triple {10279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9995#false} is VALID [2022-04-27 13:46:04,854 INFO L290 TraceCheckUtils]: 93: Hoare triple {9995#false} assume !false; {9995#false} is VALID [2022-04-27 13:46:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 13:46:04,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:46:22,014 INFO L290 TraceCheckUtils]: 93: Hoare triple {9995#false} assume !false; {9995#false} is VALID [2022-04-27 13:46:22,015 INFO L290 TraceCheckUtils]: 92: Hoare triple {10279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9995#false} is VALID [2022-04-27 13:46:22,015 INFO L290 TraceCheckUtils]: 91: Hoare triple {10275#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10279#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:46:22,016 INFO L272 TraceCheckUtils]: 90: Hoare triple {10295#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10275#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:46:22,016 INFO L290 TraceCheckUtils]: 89: Hoare triple {10295#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 20);havoc #t~post6; {10295#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:46:22,016 INFO L290 TraceCheckUtils]: 88: Hoare triple {10295#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10295#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:46:22,027 INFO L290 TraceCheckUtils]: 87: Hoare triple {10305#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10295#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:46:22,043 INFO L290 TraceCheckUtils]: 86: Hoare triple {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (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); {10305#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:46:22,044 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {9994#true} {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #86#return; {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:46:22,044 INFO L290 TraceCheckUtils]: 84: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,044 INFO L290 TraceCheckUtils]: 83: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:22,044 INFO L290 TraceCheckUtils]: 82: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:22,044 INFO L272 TraceCheckUtils]: 81: Hoare triple {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (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 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:22,045 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9994#true} {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #84#return; {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:46:22,045 INFO L290 TraceCheckUtils]: 79: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,045 INFO L290 TraceCheckUtils]: 78: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:22,045 INFO L290 TraceCheckUtils]: 77: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:22,045 INFO L272 TraceCheckUtils]: 76: Hoare triple {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:22,047 INFO L290 TraceCheckUtils]: 75: Hoare triple {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !!(#t~post6 < 20);havoc #t~post6; {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:46:22,048 INFO L290 TraceCheckUtils]: 74: Hoare triple {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (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; {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:46:22,070 INFO L290 TraceCheckUtils]: 73: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:46:22,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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); {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,383 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9994#true} {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #86#return; {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,384 INFO L290 TraceCheckUtils]: 70: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,384 INFO L290 TraceCheckUtils]: 69: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:22,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:22,384 INFO L272 TraceCheckUtils]: 67: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:22,385 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9994#true} {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #84#return; {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,385 INFO L290 TraceCheckUtils]: 65: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,385 INFO L290 TraceCheckUtils]: 64: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:22,385 INFO L290 TraceCheckUtils]: 63: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:22,385 INFO L272 TraceCheckUtils]: 62: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:22,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} assume !!(#t~post6 < 20);havoc #t~post6; {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,392 INFO L290 TraceCheckUtils]: 60: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,395 INFO L290 TraceCheckUtils]: 59: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} assume !(~r~0 >= ~d~0); {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,396 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9994#true} {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #82#return; {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,396 INFO L290 TraceCheckUtils]: 56: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:22,396 INFO L290 TraceCheckUtils]: 55: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:22,397 INFO L272 TraceCheckUtils]: 54: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:22,397 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9994#true} {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #80#return; {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:22,398 INFO L290 TraceCheckUtils]: 50: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:22,398 INFO L272 TraceCheckUtils]: 49: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:22,399 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9994#true} {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #78#return; {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,399 INFO L290 TraceCheckUtils]: 47: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:22,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:22,399 INFO L272 TraceCheckUtils]: 44: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:22,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} assume !!(#t~post5 < 20);havoc #t~post5; {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,607 INFO L290 TraceCheckUtils]: 41: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10353#(and (or (and (or (and (or (and (or (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~d~0 2) 2) 0)) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (not (< (div main_~d~0 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,619 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9994#true} {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} #82#return; {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:22,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:22,620 INFO L272 TraceCheckUtils]: 36: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:22,620 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9994#true} {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} #80#return; {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:22,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:22,620 INFO L272 TraceCheckUtils]: 31: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:22,621 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9994#true} {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} #78#return; {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:22,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:22,621 INFO L272 TraceCheckUtils]: 26: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:22,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} assume !!(#t~post5 < 20);havoc #t~post5; {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (not (< main_~p~0 0)) (and (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:46:22,651 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9994#true} {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #82#return; {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-27 13:46:22,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:22,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:22,652 INFO L272 TraceCheckUtils]: 18: Hoare triple {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:22,652 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9994#true} {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #80#return; {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-27 13:46:22,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:22,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:22,652 INFO L272 TraceCheckUtils]: 13: Hoare triple {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:22,653 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9994#true} {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #78#return; {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-27 13:46:22,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:46:22,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:46:22,653 INFO L272 TraceCheckUtils]: 8: Hoare triple {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:46:22,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !!(#t~post5 < 20);havoc #t~post5; {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-27 13:46:22,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-27 13:46:22,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {9994#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {10501#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-27 13:46:22,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {9994#true} call #t~ret7 := main(); {9994#true} is VALID [2022-04-27 13:46:22,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9994#true} {9994#true} #92#return; {9994#true} is VALID [2022-04-27 13:46:22,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:46:22,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {9994#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9994#true} is VALID [2022-04-27 13:46:22,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {9994#true} call ULTIMATE.init(); {9994#true} is VALID [2022-04-27 13:46:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 13:46:22,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:46:22,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723966831] [2022-04-27 13:46:22,656 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:46:22,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735913973] [2022-04-27 13:46:22,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735913973] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:46:22,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:46:22,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-27 13:46:22,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884508626] [2022-04-27 13:46:22,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:46:22,657 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 94 [2022-04-27 13:46:22,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:46:22,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:46:23,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:46:23,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:46:23,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:46:23,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:46:23,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:46:23,512 INFO L87 Difference]: Start difference. First operand 217 states and 255 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:46:39,382 WARN L232 SmtUtils]: Spent 14.56s on a formula simplification. DAG size of input: 192 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:46:47,394 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:46:57,329 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:47:03,573 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:47:14,062 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:47:26,185 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:47:28,188 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:47:28,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:28,946 INFO L93 Difference]: Finished difference Result 332 states and 434 transitions. [2022-04-27 13:47:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 13:47:28,946 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 94 [2022-04-27 13:47:28,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:47:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 204 transitions. [2022-04-27 13:47:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:47:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 204 transitions. [2022-04-27 13:47:28,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 204 transitions. [2022-04-27 13:47:29,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:29,879 INFO L225 Difference]: With dead ends: 332 [2022-04-27 13:47:29,879 INFO L226 Difference]: Without dead ends: 275 [2022-04-27 13:47:29,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=114, Invalid=305, Unknown=1, NotChecked=0, Total=420 [2022-04-27 13:47:29,880 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 126 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 187 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:29,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 368 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 762 Invalid, 6 Unknown, 0 Unchecked, 20.6s Time] [2022-04-27 13:47:29,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-27 13:47:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 257. [2022-04-27 13:47:30,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:30,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 257 states, 172 states have (on average 1.2267441860465116) internal successors, (211), 177 states have internal predecessors, (211), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:47:30,003 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 257 states, 172 states have (on average 1.2267441860465116) internal successors, (211), 177 states have internal predecessors, (211), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:47:30,004 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 257 states, 172 states have (on average 1.2267441860465116) internal successors, (211), 177 states have internal predecessors, (211), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:47:30,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:30,009 INFO L93 Difference]: Finished difference Result 275 states and 354 transitions. [2022-04-27 13:47:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2022-04-27 13:47:30,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:30,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:30,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 172 states have (on average 1.2267441860465116) internal successors, (211), 177 states have internal predecessors, (211), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) Second operand 275 states. [2022-04-27 13:47:30,010 INFO L87 Difference]: Start difference. First operand has 257 states, 172 states have (on average 1.2267441860465116) internal successors, (211), 177 states have internal predecessors, (211), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) Second operand 275 states. [2022-04-27 13:47:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:30,015 INFO L93 Difference]: Finished difference Result 275 states and 354 transitions. [2022-04-27 13:47:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2022-04-27 13:47:30,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:30,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:30,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:30,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 172 states have (on average 1.2267441860465116) internal successors, (211), 177 states have internal predecessors, (211), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:47:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 323 transitions. [2022-04-27 13:47:30,021 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 323 transitions. Word has length 94 [2022-04-27 13:47:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:30,022 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 323 transitions. [2022-04-27 13:47:30,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:47:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 323 transitions. [2022-04-27 13:47:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 13:47:30,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:30,023 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:30,056 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:47:30,256 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,SelfDestructingSolverStorable13 [2022-04-27 13:47:30,256 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:30,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1539828763, now seen corresponding path program 1 times [2022-04-27 13:47:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:30,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303967361] [2022-04-27 13:47:30,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:30,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:30,268 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:30,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1353755819] [2022-04-27 13:47:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:30,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:30,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:30,270 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:47:30,271 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:47:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:30,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:47:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:30,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:30,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {11941#true} call ULTIMATE.init(); {11941#true} is VALID [2022-04-27 13:47:30,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {11941#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11949#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:30,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {11949#(<= ~counter~0 0)} assume true; {11949#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:30,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11949#(<= ~counter~0 0)} {11941#true} #92#return; {11949#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:30,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {11949#(<= ~counter~0 0)} call #t~ret7 := main(); {11949#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:30,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {11949#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {11949#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:30,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {11949#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {11965#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,697 INFO L272 TraceCheckUtils]: 8: Hoare triple {11965#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {11965#(<= ~counter~0 1)} ~cond := #in~cond; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {11965#(<= ~counter~0 1)} assume !(0 == ~cond); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {11965#(<= ~counter~0 1)} assume true; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,698 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11965#(<= ~counter~0 1)} {11965#(<= ~counter~0 1)} #78#return; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,698 INFO L272 TraceCheckUtils]: 13: Hoare triple {11965#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {11965#(<= ~counter~0 1)} ~cond := #in~cond; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {11965#(<= ~counter~0 1)} assume !(0 == ~cond); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {11965#(<= ~counter~0 1)} assume true; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,700 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11965#(<= ~counter~0 1)} {11965#(<= ~counter~0 1)} #80#return; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,700 INFO L272 TraceCheckUtils]: 18: Hoare triple {11965#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {11965#(<= ~counter~0 1)} ~cond := #in~cond; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {11965#(<= ~counter~0 1)} assume !(0 == ~cond); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {11965#(<= ~counter~0 1)} assume true; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,702 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11965#(<= ~counter~0 1)} {11965#(<= ~counter~0 1)} #82#return; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {11965#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:30,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {11965#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {12020#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,704 INFO L272 TraceCheckUtils]: 26: Hoare triple {12020#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {12020#(<= ~counter~0 2)} ~cond := #in~cond; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {12020#(<= ~counter~0 2)} assume !(0 == ~cond); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {12020#(<= ~counter~0 2)} assume true; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,705 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12020#(<= ~counter~0 2)} {12020#(<= ~counter~0 2)} #78#return; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,705 INFO L272 TraceCheckUtils]: 31: Hoare triple {12020#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {12020#(<= ~counter~0 2)} ~cond := #in~cond; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {12020#(<= ~counter~0 2)} assume !(0 == ~cond); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {12020#(<= ~counter~0 2)} assume true; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,707 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12020#(<= ~counter~0 2)} {12020#(<= ~counter~0 2)} #80#return; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,707 INFO L272 TraceCheckUtils]: 36: Hoare triple {12020#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {12020#(<= ~counter~0 2)} ~cond := #in~cond; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,708 INFO L290 TraceCheckUtils]: 38: Hoare triple {12020#(<= ~counter~0 2)} assume !(0 == ~cond); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {12020#(<= ~counter~0 2)} assume true; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,709 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12020#(<= ~counter~0 2)} {12020#(<= ~counter~0 2)} #82#return; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,709 INFO L290 TraceCheckUtils]: 41: Hoare triple {12020#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:30,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {12020#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,710 INFO L290 TraceCheckUtils]: 43: Hoare triple {12075#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,710 INFO L272 TraceCheckUtils]: 44: Hoare triple {12075#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,711 INFO L290 TraceCheckUtils]: 45: Hoare triple {12075#(<= ~counter~0 3)} ~cond := #in~cond; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,711 INFO L290 TraceCheckUtils]: 46: Hoare triple {12075#(<= ~counter~0 3)} assume !(0 == ~cond); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,711 INFO L290 TraceCheckUtils]: 47: Hoare triple {12075#(<= ~counter~0 3)} assume true; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,712 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12075#(<= ~counter~0 3)} {12075#(<= ~counter~0 3)} #78#return; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,712 INFO L272 TraceCheckUtils]: 49: Hoare triple {12075#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,713 INFO L290 TraceCheckUtils]: 50: Hoare triple {12075#(<= ~counter~0 3)} ~cond := #in~cond; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,713 INFO L290 TraceCheckUtils]: 51: Hoare triple {12075#(<= ~counter~0 3)} assume !(0 == ~cond); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,713 INFO L290 TraceCheckUtils]: 52: Hoare triple {12075#(<= ~counter~0 3)} assume true; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,714 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12075#(<= ~counter~0 3)} {12075#(<= ~counter~0 3)} #80#return; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,714 INFO L272 TraceCheckUtils]: 54: Hoare triple {12075#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,714 INFO L290 TraceCheckUtils]: 55: Hoare triple {12075#(<= ~counter~0 3)} ~cond := #in~cond; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,715 INFO L290 TraceCheckUtils]: 56: Hoare triple {12075#(<= ~counter~0 3)} assume !(0 == ~cond); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,715 INFO L290 TraceCheckUtils]: 57: Hoare triple {12075#(<= ~counter~0 3)} assume true; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,715 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12075#(<= ~counter~0 3)} {12075#(<= ~counter~0 3)} #82#return; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,716 INFO L290 TraceCheckUtils]: 59: Hoare triple {12075#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:30,716 INFO L290 TraceCheckUtils]: 60: Hoare triple {12075#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,716 INFO L290 TraceCheckUtils]: 61: Hoare triple {12130#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,717 INFO L272 TraceCheckUtils]: 62: Hoare triple {12130#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,717 INFO L290 TraceCheckUtils]: 63: Hoare triple {12130#(<= ~counter~0 4)} ~cond := #in~cond; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,717 INFO L290 TraceCheckUtils]: 64: Hoare triple {12130#(<= ~counter~0 4)} assume !(0 == ~cond); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,718 INFO L290 TraceCheckUtils]: 65: Hoare triple {12130#(<= ~counter~0 4)} assume true; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,718 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12130#(<= ~counter~0 4)} {12130#(<= ~counter~0 4)} #78#return; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,719 INFO L272 TraceCheckUtils]: 67: Hoare triple {12130#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,719 INFO L290 TraceCheckUtils]: 68: Hoare triple {12130#(<= ~counter~0 4)} ~cond := #in~cond; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,719 INFO L290 TraceCheckUtils]: 69: Hoare triple {12130#(<= ~counter~0 4)} assume !(0 == ~cond); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,719 INFO L290 TraceCheckUtils]: 70: Hoare triple {12130#(<= ~counter~0 4)} assume true; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,720 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12130#(<= ~counter~0 4)} {12130#(<= ~counter~0 4)} #80#return; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,720 INFO L272 TraceCheckUtils]: 72: Hoare triple {12130#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,721 INFO L290 TraceCheckUtils]: 73: Hoare triple {12130#(<= ~counter~0 4)} ~cond := #in~cond; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,721 INFO L290 TraceCheckUtils]: 74: Hoare triple {12130#(<= ~counter~0 4)} assume !(0 == ~cond); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,721 INFO L290 TraceCheckUtils]: 75: Hoare triple {12130#(<= ~counter~0 4)} assume true; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,722 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12130#(<= ~counter~0 4)} {12130#(<= ~counter~0 4)} #82#return; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,722 INFO L290 TraceCheckUtils]: 77: Hoare triple {12130#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:30,722 INFO L290 TraceCheckUtils]: 78: Hoare triple {12130#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12185#(<= |main_#t~post5| 4)} is VALID [2022-04-27 13:47:30,723 INFO L290 TraceCheckUtils]: 79: Hoare triple {12185#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {11942#false} is VALID [2022-04-27 13:47:30,723 INFO L290 TraceCheckUtils]: 80: Hoare triple {11942#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11942#false} is VALID [2022-04-27 13:47:30,723 INFO L290 TraceCheckUtils]: 81: Hoare triple {11942#false} assume !!(#t~post6 < 20);havoc #t~post6; {11942#false} is VALID [2022-04-27 13:47:30,723 INFO L272 TraceCheckUtils]: 82: Hoare triple {11942#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {11942#false} is VALID [2022-04-27 13:47:30,723 INFO L290 TraceCheckUtils]: 83: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-27 13:47:30,723 INFO L290 TraceCheckUtils]: 84: Hoare triple {11942#false} assume !(0 == ~cond); {11942#false} is VALID [2022-04-27 13:47:30,723 INFO L290 TraceCheckUtils]: 85: Hoare triple {11942#false} assume true; {11942#false} is VALID [2022-04-27 13:47:30,723 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {11942#false} {11942#false} #84#return; {11942#false} is VALID [2022-04-27 13:47:30,723 INFO L272 TraceCheckUtils]: 87: Hoare triple {11942#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11942#false} is VALID [2022-04-27 13:47:30,723 INFO L290 TraceCheckUtils]: 88: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-27 13:47:30,723 INFO L290 TraceCheckUtils]: 89: Hoare triple {11942#false} assume !(0 == ~cond); {11942#false} is VALID [2022-04-27 13:47:30,723 INFO L290 TraceCheckUtils]: 90: Hoare triple {11942#false} assume true; {11942#false} is VALID [2022-04-27 13:47:30,723 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11942#false} {11942#false} #86#return; {11942#false} is VALID [2022-04-27 13:47:30,724 INFO L290 TraceCheckUtils]: 92: Hoare triple {11942#false} 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); {11942#false} is VALID [2022-04-27 13:47:30,724 INFO L290 TraceCheckUtils]: 93: Hoare triple {11942#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {11942#false} is VALID [2022-04-27 13:47:30,724 INFO L290 TraceCheckUtils]: 94: Hoare triple {11942#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11942#false} is VALID [2022-04-27 13:47:30,724 INFO L290 TraceCheckUtils]: 95: Hoare triple {11942#false} assume !(#t~post6 < 20);havoc #t~post6; {11942#false} is VALID [2022-04-27 13:47:30,724 INFO L272 TraceCheckUtils]: 96: Hoare triple {11942#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {11942#false} is VALID [2022-04-27 13:47:30,724 INFO L290 TraceCheckUtils]: 97: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-27 13:47:30,724 INFO L290 TraceCheckUtils]: 98: Hoare triple {11942#false} assume 0 == ~cond; {11942#false} is VALID [2022-04-27 13:47:30,724 INFO L290 TraceCheckUtils]: 99: Hoare triple {11942#false} assume !false; {11942#false} is VALID [2022-04-27 13:47:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 120 proven. 260 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-27 13:47:30,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:47:31,055 INFO L290 TraceCheckUtils]: 99: Hoare triple {11942#false} assume !false; {11942#false} is VALID [2022-04-27 13:47:31,056 INFO L290 TraceCheckUtils]: 98: Hoare triple {11942#false} assume 0 == ~cond; {11942#false} is VALID [2022-04-27 13:47:31,056 INFO L290 TraceCheckUtils]: 97: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-27 13:47:31,056 INFO L272 TraceCheckUtils]: 96: Hoare triple {11942#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {11942#false} is VALID [2022-04-27 13:47:31,056 INFO L290 TraceCheckUtils]: 95: Hoare triple {11942#false} assume !(#t~post6 < 20);havoc #t~post6; {11942#false} is VALID [2022-04-27 13:47:31,056 INFO L290 TraceCheckUtils]: 94: Hoare triple {11942#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11942#false} is VALID [2022-04-27 13:47:31,056 INFO L290 TraceCheckUtils]: 93: Hoare triple {11942#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {11942#false} is VALID [2022-04-27 13:47:31,056 INFO L290 TraceCheckUtils]: 92: Hoare triple {11942#false} 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); {11942#false} is VALID [2022-04-27 13:47:31,056 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11941#true} {11942#false} #86#return; {11942#false} is VALID [2022-04-27 13:47:31,056 INFO L290 TraceCheckUtils]: 90: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,056 INFO L290 TraceCheckUtils]: 89: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,056 INFO L290 TraceCheckUtils]: 88: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,056 INFO L272 TraceCheckUtils]: 87: Hoare triple {11942#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,057 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {11941#true} {11942#false} #84#return; {11942#false} is VALID [2022-04-27 13:47:31,057 INFO L290 TraceCheckUtils]: 85: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,057 INFO L290 TraceCheckUtils]: 84: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,057 INFO L290 TraceCheckUtils]: 83: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,057 INFO L272 TraceCheckUtils]: 82: Hoare triple {11942#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,057 INFO L290 TraceCheckUtils]: 81: Hoare triple {11942#false} assume !!(#t~post6 < 20);havoc #t~post6; {11942#false} is VALID [2022-04-27 13:47:31,057 INFO L290 TraceCheckUtils]: 80: Hoare triple {11942#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11942#false} is VALID [2022-04-27 13:47:31,057 INFO L290 TraceCheckUtils]: 79: Hoare triple {12309#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {11942#false} is VALID [2022-04-27 13:47:31,057 INFO L290 TraceCheckUtils]: 78: Hoare triple {12313#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12309#(< |main_#t~post5| 20)} is VALID [2022-04-27 13:47:31,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {12313#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12313#(< ~counter~0 20)} is VALID [2022-04-27 13:47:31,058 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {11941#true} {12313#(< ~counter~0 20)} #82#return; {12313#(< ~counter~0 20)} is VALID [2022-04-27 13:47:31,058 INFO L290 TraceCheckUtils]: 75: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,058 INFO L290 TraceCheckUtils]: 74: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,058 INFO L290 TraceCheckUtils]: 73: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,058 INFO L272 TraceCheckUtils]: 72: Hoare triple {12313#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,059 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11941#true} {12313#(< ~counter~0 20)} #80#return; {12313#(< ~counter~0 20)} is VALID [2022-04-27 13:47:31,059 INFO L290 TraceCheckUtils]: 70: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,059 INFO L290 TraceCheckUtils]: 69: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,059 INFO L290 TraceCheckUtils]: 68: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,059 INFO L272 TraceCheckUtils]: 67: Hoare triple {12313#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,060 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11941#true} {12313#(< ~counter~0 20)} #78#return; {12313#(< ~counter~0 20)} is VALID [2022-04-27 13:47:31,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,060 INFO L290 TraceCheckUtils]: 63: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,060 INFO L272 TraceCheckUtils]: 62: Hoare triple {12313#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,060 INFO L290 TraceCheckUtils]: 61: Hoare triple {12313#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {12313#(< ~counter~0 20)} is VALID [2022-04-27 13:47:31,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {12368#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12313#(< ~counter~0 20)} is VALID [2022-04-27 13:47:31,061 INFO L290 TraceCheckUtils]: 59: Hoare triple {12368#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12368#(< ~counter~0 19)} is VALID [2022-04-27 13:47:31,061 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11941#true} {12368#(< ~counter~0 19)} #82#return; {12368#(< ~counter~0 19)} is VALID [2022-04-27 13:47:31,061 INFO L290 TraceCheckUtils]: 57: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,061 INFO L290 TraceCheckUtils]: 56: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,062 INFO L290 TraceCheckUtils]: 55: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,062 INFO L272 TraceCheckUtils]: 54: Hoare triple {12368#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,072 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {11941#true} {12368#(< ~counter~0 19)} #80#return; {12368#(< ~counter~0 19)} is VALID [2022-04-27 13:47:31,073 INFO L290 TraceCheckUtils]: 52: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,073 INFO L290 TraceCheckUtils]: 51: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,073 INFO L290 TraceCheckUtils]: 50: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,073 INFO L272 TraceCheckUtils]: 49: Hoare triple {12368#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,073 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {11941#true} {12368#(< ~counter~0 19)} #78#return; {12368#(< ~counter~0 19)} is VALID [2022-04-27 13:47:31,073 INFO L290 TraceCheckUtils]: 47: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,073 INFO L290 TraceCheckUtils]: 46: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,073 INFO L290 TraceCheckUtils]: 45: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,073 INFO L272 TraceCheckUtils]: 44: Hoare triple {12368#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {12368#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {12368#(< ~counter~0 19)} is VALID [2022-04-27 13:47:31,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {12423#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12368#(< ~counter~0 19)} is VALID [2022-04-27 13:47:31,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {12423#(< ~counter~0 18)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12423#(< ~counter~0 18)} is VALID [2022-04-27 13:47:31,075 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11941#true} {12423#(< ~counter~0 18)} #82#return; {12423#(< ~counter~0 18)} is VALID [2022-04-27 13:47:31,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,075 INFO L290 TraceCheckUtils]: 38: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,076 INFO L272 TraceCheckUtils]: 36: Hoare triple {12423#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,076 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {11941#true} {12423#(< ~counter~0 18)} #80#return; {12423#(< ~counter~0 18)} is VALID [2022-04-27 13:47:31,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,076 INFO L272 TraceCheckUtils]: 31: Hoare triple {12423#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,077 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {11941#true} {12423#(< ~counter~0 18)} #78#return; {12423#(< ~counter~0 18)} is VALID [2022-04-27 13:47:31,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,077 INFO L272 TraceCheckUtils]: 26: Hoare triple {12423#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {12423#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {12423#(< ~counter~0 18)} is VALID [2022-04-27 13:47:31,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {12478#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12423#(< ~counter~0 18)} is VALID [2022-04-27 13:47:31,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {12478#(< ~counter~0 17)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12478#(< ~counter~0 17)} is VALID [2022-04-27 13:47:31,079 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11941#true} {12478#(< ~counter~0 17)} #82#return; {12478#(< ~counter~0 17)} is VALID [2022-04-27 13:47:31,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,079 INFO L272 TraceCheckUtils]: 18: Hoare triple {12478#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,079 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11941#true} {12478#(< ~counter~0 17)} #80#return; {12478#(< ~counter~0 17)} is VALID [2022-04-27 13:47:31,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,080 INFO L272 TraceCheckUtils]: 13: Hoare triple {12478#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,080 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11941#true} {12478#(< ~counter~0 17)} #78#return; {12478#(< ~counter~0 17)} is VALID [2022-04-27 13:47:31,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:47:31,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:47:31,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:47:31,080 INFO L272 TraceCheckUtils]: 8: Hoare triple {12478#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:47:31,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {12478#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {12478#(< ~counter~0 17)} is VALID [2022-04-27 13:47:31,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {12533#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12478#(< ~counter~0 17)} is VALID [2022-04-27 13:47:31,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {12533#(< ~counter~0 16)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {12533#(< ~counter~0 16)} is VALID [2022-04-27 13:47:31,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {12533#(< ~counter~0 16)} call #t~ret7 := main(); {12533#(< ~counter~0 16)} is VALID [2022-04-27 13:47:31,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12533#(< ~counter~0 16)} {11941#true} #92#return; {12533#(< ~counter~0 16)} is VALID [2022-04-27 13:47:31,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {12533#(< ~counter~0 16)} assume true; {12533#(< ~counter~0 16)} is VALID [2022-04-27 13:47:31,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {11941#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12533#(< ~counter~0 16)} is VALID [2022-04-27 13:47:31,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {11941#true} call ULTIMATE.init(); {11941#true} is VALID [2022-04-27 13:47:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-27 13:47:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:31,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303967361] [2022-04-27 13:47:31,083 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:31,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353755819] [2022-04-27 13:47:31,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353755819] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:47:31,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:47:31,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 13:47:31,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453976458] [2022-04-27 13:47:31,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:47:31,084 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) Word has length 100 [2022-04-27 13:47:31,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:31,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) [2022-04-27 13:47:31,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:31,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:47:31,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:31,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:47:31,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:47:31,169 INFO L87 Difference]: Start difference. First operand 257 states and 323 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) [2022-04-27 13:47:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:32,289 INFO L93 Difference]: Finished difference Result 746 states and 1016 transitions. [2022-04-27 13:47:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 13:47:32,290 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) Word has length 100 [2022-04-27 13:47:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) [2022-04-27 13:47:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 260 transitions. [2022-04-27 13:47:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) [2022-04-27 13:47:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 260 transitions. [2022-04-27 13:47:32,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 260 transitions. [2022-04-27 13:47:32,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:32,519 INFO L225 Difference]: With dead ends: 746 [2022-04-27 13:47:32,519 INFO L226 Difference]: Without dead ends: 659 [2022-04-27 13:47:32,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 13:47:32,524 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 208 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:32,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 286 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:47:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-04-27 13:47:32,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 552. [2022-04-27 13:47:32,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:32,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 659 states. Second operand has 552 states, 361 states have (on average 1.2825484764542936) internal successors, (463), 378 states have internal predecessors, (463), 136 states have call successors, (136), 56 states have call predecessors, (136), 54 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-27 13:47:32,868 INFO L74 IsIncluded]: Start isIncluded. First operand 659 states. Second operand has 552 states, 361 states have (on average 1.2825484764542936) internal successors, (463), 378 states have internal predecessors, (463), 136 states have call successors, (136), 56 states have call predecessors, (136), 54 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-27 13:47:32,869 INFO L87 Difference]: Start difference. First operand 659 states. Second operand has 552 states, 361 states have (on average 1.2825484764542936) internal successors, (463), 378 states have internal predecessors, (463), 136 states have call successors, (136), 56 states have call predecessors, (136), 54 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-27 13:47:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:32,886 INFO L93 Difference]: Finished difference Result 659 states and 886 transitions. [2022-04-27 13:47:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 886 transitions. [2022-04-27 13:47:32,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:32,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:32,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 552 states, 361 states have (on average 1.2825484764542936) internal successors, (463), 378 states have internal predecessors, (463), 136 states have call successors, (136), 56 states have call predecessors, (136), 54 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) Second operand 659 states. [2022-04-27 13:47:32,889 INFO L87 Difference]: Start difference. First operand has 552 states, 361 states have (on average 1.2825484764542936) internal successors, (463), 378 states have internal predecessors, (463), 136 states have call successors, (136), 56 states have call predecessors, (136), 54 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) Second operand 659 states. [2022-04-27 13:47:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:32,923 INFO L93 Difference]: Finished difference Result 659 states and 886 transitions. [2022-04-27 13:47:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 886 transitions. [2022-04-27 13:47:32,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:32,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:32,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:32,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 361 states have (on average 1.2825484764542936) internal successors, (463), 378 states have internal predecessors, (463), 136 states have call successors, (136), 56 states have call predecessors, (136), 54 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-27 13:47:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 730 transitions. [2022-04-27 13:47:32,942 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 730 transitions. Word has length 100 [2022-04-27 13:47:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:32,942 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 730 transitions. [2022-04-27 13:47:32,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) [2022-04-27 13:47:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 730 transitions. [2022-04-27 13:47:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-27 13:47:32,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:32,943 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:32,962 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:47:33,162 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,SelfDestructingSolverStorable14 [2022-04-27 13:47:33,162 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:33,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:33,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 1 times [2022-04-27 13:47:33,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:33,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110361296] [2022-04-27 13:47:33,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:33,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:33,178 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:33,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [500914884] [2022-04-27 13:47:33,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:33,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:33,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:33,179 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:47:33,180 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:47:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:33,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 13:47:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:33,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:33,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {15651#true} call ULTIMATE.init(); {15651#true} is VALID [2022-04-27 13:47:33,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {15651#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15659#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:33,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {15659#(<= ~counter~0 0)} assume true; {15659#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:33,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15659#(<= ~counter~0 0)} {15651#true} #92#return; {15659#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:33,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {15659#(<= ~counter~0 0)} call #t~ret7 := main(); {15659#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:33,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {15659#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {15659#(<= ~counter~0 0)} is VALID [2022-04-27 13:47:33,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {15659#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {15675#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,678 INFO L272 TraceCheckUtils]: 8: Hoare triple {15675#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {15675#(<= ~counter~0 1)} ~cond := #in~cond; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {15675#(<= ~counter~0 1)} assume !(0 == ~cond); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {15675#(<= ~counter~0 1)} assume true; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,679 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15675#(<= ~counter~0 1)} {15675#(<= ~counter~0 1)} #78#return; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,680 INFO L272 TraceCheckUtils]: 13: Hoare triple {15675#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {15675#(<= ~counter~0 1)} ~cond := #in~cond; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {15675#(<= ~counter~0 1)} assume !(0 == ~cond); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {15675#(<= ~counter~0 1)} assume true; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,681 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15675#(<= ~counter~0 1)} {15675#(<= ~counter~0 1)} #80#return; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,681 INFO L272 TraceCheckUtils]: 18: Hoare triple {15675#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {15675#(<= ~counter~0 1)} ~cond := #in~cond; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {15675#(<= ~counter~0 1)} assume !(0 == ~cond); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {15675#(<= ~counter~0 1)} assume true; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,683 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15675#(<= ~counter~0 1)} {15675#(<= ~counter~0 1)} #82#return; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {15675#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:47:33,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {15675#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {15730#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,684 INFO L272 TraceCheckUtils]: 26: Hoare triple {15730#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {15730#(<= ~counter~0 2)} ~cond := #in~cond; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {15730#(<= ~counter~0 2)} assume !(0 == ~cond); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {15730#(<= ~counter~0 2)} assume true; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,685 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15730#(<= ~counter~0 2)} {15730#(<= ~counter~0 2)} #78#return; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,686 INFO L272 TraceCheckUtils]: 31: Hoare triple {15730#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {15730#(<= ~counter~0 2)} ~cond := #in~cond; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {15730#(<= ~counter~0 2)} assume !(0 == ~cond); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,686 INFO L290 TraceCheckUtils]: 34: Hoare triple {15730#(<= ~counter~0 2)} assume true; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,687 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15730#(<= ~counter~0 2)} {15730#(<= ~counter~0 2)} #80#return; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,687 INFO L272 TraceCheckUtils]: 36: Hoare triple {15730#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {15730#(<= ~counter~0 2)} ~cond := #in~cond; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {15730#(<= ~counter~0 2)} assume !(0 == ~cond); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {15730#(<= ~counter~0 2)} assume true; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,688 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15730#(<= ~counter~0 2)} {15730#(<= ~counter~0 2)} #82#return; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {15730#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:47:33,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {15730#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {15785#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,690 INFO L272 TraceCheckUtils]: 44: Hoare triple {15785#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {15785#(<= ~counter~0 3)} ~cond := #in~cond; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {15785#(<= ~counter~0 3)} assume !(0 == ~cond); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {15785#(<= ~counter~0 3)} assume true; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,691 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15785#(<= ~counter~0 3)} {15785#(<= ~counter~0 3)} #78#return; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,692 INFO L272 TraceCheckUtils]: 49: Hoare triple {15785#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,692 INFO L290 TraceCheckUtils]: 50: Hoare triple {15785#(<= ~counter~0 3)} ~cond := #in~cond; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,692 INFO L290 TraceCheckUtils]: 51: Hoare triple {15785#(<= ~counter~0 3)} assume !(0 == ~cond); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {15785#(<= ~counter~0 3)} assume true; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,693 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15785#(<= ~counter~0 3)} {15785#(<= ~counter~0 3)} #80#return; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,693 INFO L272 TraceCheckUtils]: 54: Hoare triple {15785#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,694 INFO L290 TraceCheckUtils]: 55: Hoare triple {15785#(<= ~counter~0 3)} ~cond := #in~cond; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,694 INFO L290 TraceCheckUtils]: 56: Hoare triple {15785#(<= ~counter~0 3)} assume !(0 == ~cond); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,694 INFO L290 TraceCheckUtils]: 57: Hoare triple {15785#(<= ~counter~0 3)} assume true; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,695 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15785#(<= ~counter~0 3)} {15785#(<= ~counter~0 3)} #82#return; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,695 INFO L290 TraceCheckUtils]: 59: Hoare triple {15785#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:47:33,696 INFO L290 TraceCheckUtils]: 60: Hoare triple {15785#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,696 INFO L290 TraceCheckUtils]: 61: Hoare triple {15840#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,697 INFO L272 TraceCheckUtils]: 62: Hoare triple {15840#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,697 INFO L290 TraceCheckUtils]: 63: Hoare triple {15840#(<= ~counter~0 4)} ~cond := #in~cond; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,697 INFO L290 TraceCheckUtils]: 64: Hoare triple {15840#(<= ~counter~0 4)} assume !(0 == ~cond); {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,697 INFO L290 TraceCheckUtils]: 65: Hoare triple {15840#(<= ~counter~0 4)} assume true; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,698 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15840#(<= ~counter~0 4)} {15840#(<= ~counter~0 4)} #84#return; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,698 INFO L272 TraceCheckUtils]: 67: Hoare triple {15840#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,699 INFO L290 TraceCheckUtils]: 68: Hoare triple {15840#(<= ~counter~0 4)} ~cond := #in~cond; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,699 INFO L290 TraceCheckUtils]: 69: Hoare triple {15840#(<= ~counter~0 4)} assume !(0 == ~cond); {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,699 INFO L290 TraceCheckUtils]: 70: Hoare triple {15840#(<= ~counter~0 4)} assume true; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,700 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15840#(<= ~counter~0 4)} {15840#(<= ~counter~0 4)} #86#return; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,700 INFO L290 TraceCheckUtils]: 72: Hoare triple {15840#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,700 INFO L290 TraceCheckUtils]: 73: Hoare triple {15840#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:47:33,701 INFO L290 TraceCheckUtils]: 74: Hoare triple {15840#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,701 INFO L290 TraceCheckUtils]: 75: Hoare triple {15883#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,702 INFO L272 TraceCheckUtils]: 76: Hoare triple {15883#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,702 INFO L290 TraceCheckUtils]: 77: Hoare triple {15883#(<= ~counter~0 5)} ~cond := #in~cond; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,702 INFO L290 TraceCheckUtils]: 78: Hoare triple {15883#(<= ~counter~0 5)} assume !(0 == ~cond); {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,703 INFO L290 TraceCheckUtils]: 79: Hoare triple {15883#(<= ~counter~0 5)} assume true; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,703 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15883#(<= ~counter~0 5)} {15883#(<= ~counter~0 5)} #84#return; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,704 INFO L272 TraceCheckUtils]: 81: Hoare triple {15883#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,704 INFO L290 TraceCheckUtils]: 82: Hoare triple {15883#(<= ~counter~0 5)} ~cond := #in~cond; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,704 INFO L290 TraceCheckUtils]: 83: Hoare triple {15883#(<= ~counter~0 5)} assume !(0 == ~cond); {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,705 INFO L290 TraceCheckUtils]: 84: Hoare triple {15883#(<= ~counter~0 5)} assume true; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,705 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15883#(<= ~counter~0 5)} {15883#(<= ~counter~0 5)} #86#return; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,705 INFO L290 TraceCheckUtils]: 86: Hoare triple {15883#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,706 INFO L290 TraceCheckUtils]: 87: Hoare triple {15883#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:47:33,706 INFO L290 TraceCheckUtils]: 88: Hoare triple {15883#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,707 INFO L290 TraceCheckUtils]: 89: Hoare triple {15926#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,707 INFO L272 TraceCheckUtils]: 90: Hoare triple {15926#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,707 INFO L290 TraceCheckUtils]: 91: Hoare triple {15926#(<= ~counter~0 6)} ~cond := #in~cond; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,708 INFO L290 TraceCheckUtils]: 92: Hoare triple {15926#(<= ~counter~0 6)} assume !(0 == ~cond); {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,708 INFO L290 TraceCheckUtils]: 93: Hoare triple {15926#(<= ~counter~0 6)} assume true; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,708 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15926#(<= ~counter~0 6)} {15926#(<= ~counter~0 6)} #84#return; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,709 INFO L272 TraceCheckUtils]: 95: Hoare triple {15926#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,709 INFO L290 TraceCheckUtils]: 96: Hoare triple {15926#(<= ~counter~0 6)} ~cond := #in~cond; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,709 INFO L290 TraceCheckUtils]: 97: Hoare triple {15926#(<= ~counter~0 6)} assume !(0 == ~cond); {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,710 INFO L290 TraceCheckUtils]: 98: Hoare triple {15926#(<= ~counter~0 6)} assume true; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,710 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {15926#(<= ~counter~0 6)} {15926#(<= ~counter~0 6)} #86#return; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,710 INFO L290 TraceCheckUtils]: 100: Hoare triple {15926#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,711 INFO L290 TraceCheckUtils]: 101: Hoare triple {15926#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:47:33,711 INFO L290 TraceCheckUtils]: 102: Hoare triple {15926#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15969#(<= |main_#t~post6| 6)} is VALID [2022-04-27 13:47:33,711 INFO L290 TraceCheckUtils]: 103: Hoare triple {15969#(<= |main_#t~post6| 6)} assume !(#t~post6 < 20);havoc #t~post6; {15652#false} is VALID [2022-04-27 13:47:33,711 INFO L272 TraceCheckUtils]: 104: Hoare triple {15652#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {15652#false} is VALID [2022-04-27 13:47:33,712 INFO L290 TraceCheckUtils]: 105: Hoare triple {15652#false} ~cond := #in~cond; {15652#false} is VALID [2022-04-27 13:47:33,712 INFO L290 TraceCheckUtils]: 106: Hoare triple {15652#false} assume 0 == ~cond; {15652#false} is VALID [2022-04-27 13:47:33,712 INFO L290 TraceCheckUtils]: 107: Hoare triple {15652#false} assume !false; {15652#false} is VALID [2022-04-27 13:47:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 30 proven. 414 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 13:47:33,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:47:34,140 INFO L290 TraceCheckUtils]: 107: Hoare triple {15652#false} assume !false; {15652#false} is VALID [2022-04-27 13:47:34,140 INFO L290 TraceCheckUtils]: 106: Hoare triple {15652#false} assume 0 == ~cond; {15652#false} is VALID [2022-04-27 13:47:34,140 INFO L290 TraceCheckUtils]: 105: Hoare triple {15652#false} ~cond := #in~cond; {15652#false} is VALID [2022-04-27 13:47:34,140 INFO L272 TraceCheckUtils]: 104: Hoare triple {15652#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {15652#false} is VALID [2022-04-27 13:47:34,140 INFO L290 TraceCheckUtils]: 103: Hoare triple {15997#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {15652#false} is VALID [2022-04-27 13:47:34,141 INFO L290 TraceCheckUtils]: 102: Hoare triple {16001#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15997#(< |main_#t~post6| 20)} is VALID [2022-04-27 13:47:34,141 INFO L290 TraceCheckUtils]: 101: Hoare triple {16001#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {16001#(< ~counter~0 20)} is VALID [2022-04-27 13:47:34,141 INFO L290 TraceCheckUtils]: 100: Hoare triple {16001#(< ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {16001#(< ~counter~0 20)} is VALID [2022-04-27 13:47:34,142 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {15651#true} {16001#(< ~counter~0 20)} #86#return; {16001#(< ~counter~0 20)} is VALID [2022-04-27 13:47:34,142 INFO L290 TraceCheckUtils]: 98: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,142 INFO L290 TraceCheckUtils]: 97: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,142 INFO L290 TraceCheckUtils]: 96: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,142 INFO L272 TraceCheckUtils]: 95: Hoare triple {16001#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,143 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15651#true} {16001#(< ~counter~0 20)} #84#return; {16001#(< ~counter~0 20)} is VALID [2022-04-27 13:47:34,143 INFO L290 TraceCheckUtils]: 93: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,143 INFO L290 TraceCheckUtils]: 92: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,143 INFO L290 TraceCheckUtils]: 91: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,143 INFO L272 TraceCheckUtils]: 90: Hoare triple {16001#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,143 INFO L290 TraceCheckUtils]: 89: Hoare triple {16001#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {16001#(< ~counter~0 20)} is VALID [2022-04-27 13:47:34,144 INFO L290 TraceCheckUtils]: 88: Hoare triple {16044#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16001#(< ~counter~0 20)} is VALID [2022-04-27 13:47:34,144 INFO L290 TraceCheckUtils]: 87: Hoare triple {16044#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {16044#(< ~counter~0 19)} is VALID [2022-04-27 13:47:34,144 INFO L290 TraceCheckUtils]: 86: Hoare triple {16044#(< ~counter~0 19)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {16044#(< ~counter~0 19)} is VALID [2022-04-27 13:47:34,145 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15651#true} {16044#(< ~counter~0 19)} #86#return; {16044#(< ~counter~0 19)} is VALID [2022-04-27 13:47:34,145 INFO L290 TraceCheckUtils]: 84: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,145 INFO L290 TraceCheckUtils]: 83: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,145 INFO L290 TraceCheckUtils]: 82: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,145 INFO L272 TraceCheckUtils]: 81: Hoare triple {16044#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,152 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15651#true} {16044#(< ~counter~0 19)} #84#return; {16044#(< ~counter~0 19)} is VALID [2022-04-27 13:47:34,152 INFO L290 TraceCheckUtils]: 79: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,152 INFO L290 TraceCheckUtils]: 78: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,152 INFO L290 TraceCheckUtils]: 77: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,152 INFO L272 TraceCheckUtils]: 76: Hoare triple {16044#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,152 INFO L290 TraceCheckUtils]: 75: Hoare triple {16044#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {16044#(< ~counter~0 19)} is VALID [2022-04-27 13:47:34,153 INFO L290 TraceCheckUtils]: 74: Hoare triple {16087#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16044#(< ~counter~0 19)} is VALID [2022-04-27 13:47:34,153 INFO L290 TraceCheckUtils]: 73: Hoare triple {16087#(< ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {16087#(< ~counter~0 18)} is VALID [2022-04-27 13:47:34,154 INFO L290 TraceCheckUtils]: 72: Hoare triple {16087#(< ~counter~0 18)} 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); {16087#(< ~counter~0 18)} is VALID [2022-04-27 13:47:34,154 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15651#true} {16087#(< ~counter~0 18)} #86#return; {16087#(< ~counter~0 18)} is VALID [2022-04-27 13:47:34,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,154 INFO L290 TraceCheckUtils]: 68: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,154 INFO L272 TraceCheckUtils]: 67: Hoare triple {16087#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,155 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15651#true} {16087#(< ~counter~0 18)} #84#return; {16087#(< ~counter~0 18)} is VALID [2022-04-27 13:47:34,155 INFO L290 TraceCheckUtils]: 65: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,155 INFO L290 TraceCheckUtils]: 64: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,155 INFO L290 TraceCheckUtils]: 63: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,155 INFO L272 TraceCheckUtils]: 62: Hoare triple {16087#(< ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,155 INFO L290 TraceCheckUtils]: 61: Hoare triple {16087#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {16087#(< ~counter~0 18)} is VALID [2022-04-27 13:47:34,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {16130#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16087#(< ~counter~0 18)} is VALID [2022-04-27 13:47:34,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {16130#(< ~counter~0 17)} assume !(~r~0 >= ~d~0); {16130#(< ~counter~0 17)} is VALID [2022-04-27 13:47:34,157 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15651#true} {16130#(< ~counter~0 17)} #82#return; {16130#(< ~counter~0 17)} is VALID [2022-04-27 13:47:34,157 INFO L290 TraceCheckUtils]: 57: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,157 INFO L290 TraceCheckUtils]: 56: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,157 INFO L290 TraceCheckUtils]: 55: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,157 INFO L272 TraceCheckUtils]: 54: Hoare triple {16130#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,157 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15651#true} {16130#(< ~counter~0 17)} #80#return; {16130#(< ~counter~0 17)} is VALID [2022-04-27 13:47:34,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,157 INFO L290 TraceCheckUtils]: 50: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,157 INFO L272 TraceCheckUtils]: 49: Hoare triple {16130#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,158 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15651#true} {16130#(< ~counter~0 17)} #78#return; {16130#(< ~counter~0 17)} is VALID [2022-04-27 13:47:34,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,158 INFO L290 TraceCheckUtils]: 45: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,158 INFO L272 TraceCheckUtils]: 44: Hoare triple {16130#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {16130#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {16130#(< ~counter~0 17)} is VALID [2022-04-27 13:47:34,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {16185#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16130#(< ~counter~0 17)} is VALID [2022-04-27 13:47:34,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {16185#(< ~counter~0 16)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16185#(< ~counter~0 16)} is VALID [2022-04-27 13:47:34,160 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15651#true} {16185#(< ~counter~0 16)} #82#return; {16185#(< ~counter~0 16)} is VALID [2022-04-27 13:47:34,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,160 INFO L272 TraceCheckUtils]: 36: Hoare triple {16185#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,160 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15651#true} {16185#(< ~counter~0 16)} #80#return; {16185#(< ~counter~0 16)} is VALID [2022-04-27 13:47:34,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,161 INFO L272 TraceCheckUtils]: 31: Hoare triple {16185#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,161 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15651#true} {16185#(< ~counter~0 16)} #78#return; {16185#(< ~counter~0 16)} is VALID [2022-04-27 13:47:34,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,161 INFO L272 TraceCheckUtils]: 26: Hoare triple {16185#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {16185#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {16185#(< ~counter~0 16)} is VALID [2022-04-27 13:47:34,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {16240#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16185#(< ~counter~0 16)} is VALID [2022-04-27 13:47:34,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {16240#(< ~counter~0 15)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16240#(< ~counter~0 15)} is VALID [2022-04-27 13:47:34,163 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15651#true} {16240#(< ~counter~0 15)} #82#return; {16240#(< ~counter~0 15)} is VALID [2022-04-27 13:47:34,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,163 INFO L272 TraceCheckUtils]: 18: Hoare triple {16240#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,163 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15651#true} {16240#(< ~counter~0 15)} #80#return; {16240#(< ~counter~0 15)} is VALID [2022-04-27 13:47:34,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,164 INFO L272 TraceCheckUtils]: 13: Hoare triple {16240#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,164 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15651#true} {16240#(< ~counter~0 15)} #78#return; {16240#(< ~counter~0 15)} is VALID [2022-04-27 13:47:34,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:47:34,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:47:34,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:47:34,164 INFO L272 TraceCheckUtils]: 8: Hoare triple {16240#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:47:34,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {16240#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {16240#(< ~counter~0 15)} is VALID [2022-04-27 13:47:34,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {16295#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16240#(< ~counter~0 15)} is VALID [2022-04-27 13:47:34,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {16295#(< ~counter~0 14)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {16295#(< ~counter~0 14)} is VALID [2022-04-27 13:47:34,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {16295#(< ~counter~0 14)} call #t~ret7 := main(); {16295#(< ~counter~0 14)} is VALID [2022-04-27 13:47:34,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16295#(< ~counter~0 14)} {15651#true} #92#return; {16295#(< ~counter~0 14)} is VALID [2022-04-27 13:47:34,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {16295#(< ~counter~0 14)} assume true; {16295#(< ~counter~0 14)} is VALID [2022-04-27 13:47:34,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {15651#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16295#(< ~counter~0 14)} is VALID [2022-04-27 13:47:34,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {15651#true} call ULTIMATE.init(); {15651#true} is VALID [2022-04-27 13:47:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-27 13:47:34,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:34,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110361296] [2022-04-27 13:47:34,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:34,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500914884] [2022-04-27 13:47:34,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500914884] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:47:34,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:47:34,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-27 13:47:34,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880245867] [2022-04-27 13:47:34,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:47:34,168 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) Word has length 108 [2022-04-27 13:47:34,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:34,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2022-04-27 13:47:34,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:34,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 13:47:34,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:34,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 13:47:34,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-27 13:47:34,270 INFO L87 Difference]: Start difference. First operand 552 states and 730 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2022-04-27 13:47:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:36,275 INFO L93 Difference]: Finished difference Result 1159 states and 1613 transitions. [2022-04-27 13:47:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 13:47:36,275 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) Word has length 108 [2022-04-27 13:47:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2022-04-27 13:47:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 363 transitions. [2022-04-27 13:47:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2022-04-27 13:47:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 363 transitions. [2022-04-27 13:47:36,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 363 transitions. [2022-04-27 13:47:36,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:36,610 INFO L225 Difference]: With dead ends: 1159 [2022-04-27 13:47:36,610 INFO L226 Difference]: Without dead ends: 1122 [2022-04-27 13:47:36,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=497, Unknown=0, NotChecked=0, Total=756 [2022-04-27 13:47:36,611 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 345 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:36,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 402 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 13:47:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-04-27 13:47:37,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1097. [2022-04-27 13:47:37,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:37,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1122 states. Second operand has 1097 states, 729 states have (on average 1.2455418381344308) internal successors, (908), 758 states have internal predecessors, (908), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:47:37,319 INFO L74 IsIncluded]: Start isIncluded. First operand 1122 states. Second operand has 1097 states, 729 states have (on average 1.2455418381344308) internal successors, (908), 758 states have internal predecessors, (908), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:47:37,320 INFO L87 Difference]: Start difference. First operand 1122 states. Second operand has 1097 states, 729 states have (on average 1.2455418381344308) internal successors, (908), 758 states have internal predecessors, (908), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:47:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:37,362 INFO L93 Difference]: Finished difference Result 1122 states and 1474 transitions. [2022-04-27 13:47:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1474 transitions. [2022-04-27 13:47:37,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:37,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:37,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 1097 states, 729 states have (on average 1.2455418381344308) internal successors, (908), 758 states have internal predecessors, (908), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) Second operand 1122 states. [2022-04-27 13:47:37,369 INFO L87 Difference]: Start difference. First operand has 1097 states, 729 states have (on average 1.2455418381344308) internal successors, (908), 758 states have internal predecessors, (908), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) Second operand 1122 states. [2022-04-27 13:47:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:37,410 INFO L93 Difference]: Finished difference Result 1122 states and 1474 transitions. [2022-04-27 13:47:37,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1474 transitions. [2022-04-27 13:47:37,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:37,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:37,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:37,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 729 states have (on average 1.2455418381344308) internal successors, (908), 758 states have internal predecessors, (908), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:47:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1457 transitions. [2022-04-27 13:47:37,467 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1457 transitions. Word has length 108 [2022-04-27 13:47:37,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:37,468 INFO L495 AbstractCegarLoop]: Abstraction has 1097 states and 1457 transitions. [2022-04-27 13:47:37,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2022-04-27 13:47:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1457 transitions. [2022-04-27 13:47:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 13:47:37,471 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:37,471 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:37,490 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:47:37,683 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,SelfDestructingSolverStorable15 [2022-04-27 13:47:37,683 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:37,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1873291208, now seen corresponding path program 1 times [2022-04-27 13:47:37,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:37,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837455403] [2022-04-27 13:47:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:37,693 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:37,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894582506] [2022-04-27 13:47:37,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:37,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:37,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:37,694 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:47:37,696 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:47:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:37,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 13:47:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:37,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:38,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {21622#true} call ULTIMATE.init(); {21622#true} is VALID [2022-04-27 13:47:38,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {21622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21622#true} is VALID [2022-04-27 13:47:38,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21622#true} {21622#true} #92#return; {21622#true} is VALID [2022-04-27 13:47:38,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {21622#true} call #t~ret7 := main(); {21622#true} is VALID [2022-04-27 13:47:38,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {21622#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,236 INFO L272 TraceCheckUtils]: 8: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,237 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {21622#true} {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #78#return; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,237 INFO L272 TraceCheckUtils]: 13: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,237 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21622#true} {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #80#return; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,237 INFO L272 TraceCheckUtils]: 18: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,238 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21622#true} {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #82#return; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:47:38,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:47:38,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:47:38,239 INFO L272 TraceCheckUtils]: 26: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,240 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {21622#true} {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #78#return; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:47:38,240 INFO L272 TraceCheckUtils]: 31: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,240 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {21622#true} {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #80#return; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:47:38,240 INFO L272 TraceCheckUtils]: 36: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,241 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {21622#true} {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #82#return; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:47:38,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:47:38,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:47:38,242 INFO L290 TraceCheckUtils]: 43: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} assume !!(#t~post5 < 20);havoc #t~post5; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:47:38,242 INFO L272 TraceCheckUtils]: 44: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,242 INFO L290 TraceCheckUtils]: 45: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,242 INFO L290 TraceCheckUtils]: 46: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,242 INFO L290 TraceCheckUtils]: 47: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,251 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {21622#true} {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #78#return; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:47:38,252 INFO L272 TraceCheckUtils]: 49: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,252 INFO L290 TraceCheckUtils]: 51: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,252 INFO L290 TraceCheckUtils]: 52: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,252 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {21622#true} {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #80#return; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:47:38,252 INFO L272 TraceCheckUtils]: 54: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,253 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {21622#true} {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #82#return; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:47:38,253 INFO L290 TraceCheckUtils]: 59: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} assume !(~r~0 >= ~d~0); {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:47:38,254 INFO L290 TraceCheckUtils]: 60: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:47:38,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} assume !!(#t~post6 < 20);havoc #t~post6; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:47:38,254 INFO L272 TraceCheckUtils]: 62: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,254 INFO L290 TraceCheckUtils]: 63: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,254 INFO L290 TraceCheckUtils]: 64: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,254 INFO L290 TraceCheckUtils]: 65: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,255 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21622#true} {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #84#return; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:47:38,255 INFO L272 TraceCheckUtils]: 67: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,255 INFO L290 TraceCheckUtils]: 68: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,255 INFO L290 TraceCheckUtils]: 69: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,255 INFO L290 TraceCheckUtils]: 70: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,255 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21622#true} {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #86#return; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:47:38,256 INFO L290 TraceCheckUtils]: 72: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~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); {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:47:38,257 INFO L290 TraceCheckUtils]: 73: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:47:38,257 INFO L290 TraceCheckUtils]: 74: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:47:38,257 INFO L290 TraceCheckUtils]: 75: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} assume !!(#t~post6 < 20);havoc #t~post6; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:47:38,257 INFO L272 TraceCheckUtils]: 76: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,257 INFO L290 TraceCheckUtils]: 77: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,257 INFO L290 TraceCheckUtils]: 78: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,257 INFO L290 TraceCheckUtils]: 79: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,258 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {21622#true} {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #84#return; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:47:38,258 INFO L272 TraceCheckUtils]: 81: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,258 INFO L290 TraceCheckUtils]: 82: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,258 INFO L290 TraceCheckUtils]: 83: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,258 INFO L290 TraceCheckUtils]: 84: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,259 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {21622#true} {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #86#return; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:47:38,259 INFO L290 TraceCheckUtils]: 86: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) 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); {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,260 INFO L290 TraceCheckUtils]: 87: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,260 INFO L290 TraceCheckUtils]: 88: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,260 INFO L290 TraceCheckUtils]: 89: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 20);havoc #t~post6; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,260 INFO L272 TraceCheckUtils]: 90: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,260 INFO L290 TraceCheckUtils]: 91: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,260 INFO L290 TraceCheckUtils]: 92: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,261 INFO L290 TraceCheckUtils]: 93: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,261 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21622#true} {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #84#return; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,261 INFO L272 TraceCheckUtils]: 95: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,261 INFO L290 TraceCheckUtils]: 96: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,261 INFO L290 TraceCheckUtils]: 97: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,261 INFO L290 TraceCheckUtils]: 98: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,262 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {21622#true} {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #86#return; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,262 INFO L290 TraceCheckUtils]: 100: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} assume !(1 != ~p~0); {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,262 INFO L272 TraceCheckUtils]: 101: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:38,262 INFO L290 TraceCheckUtils]: 102: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:38,262 INFO L290 TraceCheckUtils]: 103: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:38,262 INFO L290 TraceCheckUtils]: 104: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:38,263 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {21622#true} {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #88#return; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:47:38,263 INFO L272 TraceCheckUtils]: 106: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {21948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:47:38,263 INFO L290 TraceCheckUtils]: 107: Hoare triple {21948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:47:38,264 INFO L290 TraceCheckUtils]: 108: Hoare triple {21952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21623#false} is VALID [2022-04-27 13:47:38,264 INFO L290 TraceCheckUtils]: 109: Hoare triple {21623#false} assume !false; {21623#false} is VALID [2022-04-27 13:47:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 32 proven. 34 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-27 13:47:38,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:47:39,300 INFO L290 TraceCheckUtils]: 109: Hoare triple {21623#false} assume !false; {21623#false} is VALID [2022-04-27 13:47:39,301 INFO L290 TraceCheckUtils]: 108: Hoare triple {21952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21623#false} is VALID [2022-04-27 13:47:39,301 INFO L290 TraceCheckUtils]: 107: Hoare triple {21948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:47:39,302 INFO L272 TraceCheckUtils]: 106: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {21948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:47:39,302 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {21622#true} {21968#(= main_~B~0 main_~d~0)} #88#return; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,302 INFO L290 TraceCheckUtils]: 104: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,302 INFO L290 TraceCheckUtils]: 103: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,302 INFO L290 TraceCheckUtils]: 102: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,302 INFO L272 TraceCheckUtils]: 101: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,303 INFO L290 TraceCheckUtils]: 100: Hoare triple {21968#(= main_~B~0 main_~d~0)} assume !(1 != ~p~0); {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,303 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {21622#true} {21968#(= main_~B~0 main_~d~0)} #86#return; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,303 INFO L290 TraceCheckUtils]: 98: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,303 INFO L290 TraceCheckUtils]: 97: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,303 INFO L290 TraceCheckUtils]: 96: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,303 INFO L272 TraceCheckUtils]: 95: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,304 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21622#true} {21968#(= main_~B~0 main_~d~0)} #84#return; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,304 INFO L290 TraceCheckUtils]: 93: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,304 INFO L290 TraceCheckUtils]: 92: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,304 INFO L290 TraceCheckUtils]: 91: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,304 INFO L272 TraceCheckUtils]: 90: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,304 INFO L290 TraceCheckUtils]: 89: Hoare triple {21968#(= main_~B~0 main_~d~0)} assume !!(#t~post6 < 20);havoc #t~post6; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,305 INFO L290 TraceCheckUtils]: 88: Hoare triple {21968#(= main_~B~0 main_~d~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,305 INFO L290 TraceCheckUtils]: 87: Hoare triple {21968#(= main_~B~0 main_~d~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,306 INFO L290 TraceCheckUtils]: 86: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,307 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {21622#true} {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #86#return; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,307 INFO L290 TraceCheckUtils]: 84: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,307 INFO L290 TraceCheckUtils]: 83: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,307 INFO L290 TraceCheckUtils]: 82: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,307 INFO L272 TraceCheckUtils]: 81: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,307 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {21622#true} {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #84#return; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,307 INFO L290 TraceCheckUtils]: 79: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,308 INFO L290 TraceCheckUtils]: 78: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,308 INFO L290 TraceCheckUtils]: 77: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,308 INFO L272 TraceCheckUtils]: 76: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,308 INFO L290 TraceCheckUtils]: 75: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(#t~post6 < 20);havoc #t~post6; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,309 INFO L290 TraceCheckUtils]: 74: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,310 INFO L290 TraceCheckUtils]: 73: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,312 INFO L290 TraceCheckUtils]: 72: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,312 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21622#true} {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #86#return; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,312 INFO L290 TraceCheckUtils]: 70: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,312 INFO L290 TraceCheckUtils]: 69: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,312 INFO L290 TraceCheckUtils]: 68: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,312 INFO L272 TraceCheckUtils]: 67: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,313 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21622#true} {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #84#return; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,313 INFO L272 TraceCheckUtils]: 62: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,314 INFO L290 TraceCheckUtils]: 61: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(#t~post6 < 20);havoc #t~post6; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,315 INFO L290 TraceCheckUtils]: 60: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,316 INFO L290 TraceCheckUtils]: 59: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !(~r~0 >= ~d~0); {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,316 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {21622#true} {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #82#return; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,316 INFO L272 TraceCheckUtils]: 54: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,317 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {21622#true} {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #80#return; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,317 INFO L290 TraceCheckUtils]: 51: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,317 INFO L272 TraceCheckUtils]: 49: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,317 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {21622#true} {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #78#return; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,318 INFO L272 TraceCheckUtils]: 44: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,319 INFO L290 TraceCheckUtils]: 43: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(#t~post5 < 20);havoc #t~post5; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,322 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {21622#true} {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #82#return; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,322 INFO L272 TraceCheckUtils]: 36: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,323 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {21622#true} {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #80#return; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,323 INFO L272 TraceCheckUtils]: 31: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,324 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {21622#true} {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #78#return; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,324 INFO L272 TraceCheckUtils]: 26: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(#t~post5 < 20);havoc #t~post5; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {21968#(= main_~B~0 main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:47:39,326 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21622#true} {21968#(= main_~B~0 main_~d~0)} #82#return; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,326 INFO L272 TraceCheckUtils]: 18: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,327 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21622#true} {21968#(= main_~B~0 main_~d~0)} #80#return; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,327 INFO L272 TraceCheckUtils]: 13: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,327 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {21622#true} {21968#(= main_~B~0 main_~d~0)} #78#return; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:47:39,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:47:39,328 INFO L272 TraceCheckUtils]: 8: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:47:39,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {21968#(= main_~B~0 main_~d~0)} assume !!(#t~post5 < 20);havoc #t~post5; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {21968#(= main_~B~0 main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {21622#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:47:39,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {21622#true} call #t~ret7 := main(); {21622#true} is VALID [2022-04-27 13:47:39,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21622#true} {21622#true} #92#return; {21622#true} is VALID [2022-04-27 13:47:39,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:47:39,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {21622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21622#true} is VALID [2022-04-27 13:47:39,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {21622#true} call ULTIMATE.init(); {21622#true} is VALID [2022-04-27 13:47:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 32 proven. 34 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-27 13:47:39,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:39,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837455403] [2022-04-27 13:47:39,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:39,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894582506] [2022-04-27 13:47:39,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894582506] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:47:39,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:47:39,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 13:47:39,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213964879] [2022-04-27 13:47:39,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:47:39,330 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) Word has length 110 [2022-04-27 13:47:39,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:39,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 13:47:39,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:39,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:47:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:39,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:47:39,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:47:39,442 INFO L87 Difference]: Start difference. First operand 1097 states and 1457 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 13:47:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:42,120 INFO L93 Difference]: Finished difference Result 1103 states and 1463 transitions. [2022-04-27 13:47:42,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:47:42,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) Word has length 110 [2022-04-27 13:47:42,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 13:47:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-27 13:47:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 13:47:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-27 13:47:42,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2022-04-27 13:47:42,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:42,239 INFO L225 Difference]: With dead ends: 1103 [2022-04-27 13:47:42,239 INFO L226 Difference]: Without dead ends: 1097 [2022-04-27 13:47:42,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:47:42,240 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 2 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:42,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 328 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 13:47:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-04-27 13:47:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2022-04-27 13:47:42,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:42,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1097 states. Second operand has 1097 states, 729 states have (on average 1.242798353909465) internal successors, (906), 758 states have internal predecessors, (906), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:47:42,879 INFO L74 IsIncluded]: Start isIncluded. First operand 1097 states. Second operand has 1097 states, 729 states have (on average 1.242798353909465) internal successors, (906), 758 states have internal predecessors, (906), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:47:42,880 INFO L87 Difference]: Start difference. First operand 1097 states. Second operand has 1097 states, 729 states have (on average 1.242798353909465) internal successors, (906), 758 states have internal predecessors, (906), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:47:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:42,916 INFO L93 Difference]: Finished difference Result 1097 states and 1455 transitions. [2022-04-27 13:47:42,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1455 transitions. [2022-04-27 13:47:42,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:42,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:42,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 1097 states, 729 states have (on average 1.242798353909465) internal successors, (906), 758 states have internal predecessors, (906), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) Second operand 1097 states. [2022-04-27 13:47:42,921 INFO L87 Difference]: Start difference. First operand has 1097 states, 729 states have (on average 1.242798353909465) internal successors, (906), 758 states have internal predecessors, (906), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) Second operand 1097 states. [2022-04-27 13:47:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:42,956 INFO L93 Difference]: Finished difference Result 1097 states and 1455 transitions. [2022-04-27 13:47:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1455 transitions. [2022-04-27 13:47:42,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:42,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:42,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:42,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 729 states have (on average 1.242798353909465) internal successors, (906), 758 states have internal predecessors, (906), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:47:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1455 transitions. [2022-04-27 13:47:43,006 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1455 transitions. Word has length 110 [2022-04-27 13:47:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:43,006 INFO L495 AbstractCegarLoop]: Abstraction has 1097 states and 1455 transitions. [2022-04-27 13:47:43,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 13:47:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1455 transitions. [2022-04-27 13:47:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-27 13:47:43,007 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:43,007 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:43,024 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:47:43,223 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,SelfDestructingSolverStorable16 [2022-04-27 13:47:43,223 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:43,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:43,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1491499276, now seen corresponding path program 2 times [2022-04-27 13:47:43,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:43,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186058600] [2022-04-27 13:47:43,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:43,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:43,236 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:43,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [903148057] [2022-04-27 13:47:43,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:47:43,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:43,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:43,237 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:47:43,238 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:47:43,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:47:43,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:47:43,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 13:47:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:43,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:43,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {27456#true} call ULTIMATE.init(); {27456#true} is VALID [2022-04-27 13:47:43,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {27456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27456#true} is VALID [2022-04-27 13:47:43,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27456#true} {27456#true} #92#return; {27456#true} is VALID [2022-04-27 13:47:43,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {27456#true} call #t~ret7 := main(); {27456#true} is VALID [2022-04-27 13:47:43,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {27456#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:47:43,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {27476#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:47:43,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {27476#(= main_~p~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:47:43,526 INFO L272 TraceCheckUtils]: 8: Hoare triple {27476#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,526 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #78#return; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:47:43,526 INFO L272 TraceCheckUtils]: 13: Hoare triple {27476#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,527 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #80#return; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:47:43,527 INFO L272 TraceCheckUtils]: 18: Hoare triple {27476#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,527 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #82#return; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:47:43,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {27476#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:47:43,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {27531#(= main_~p~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:47:43,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {27531#(= main_~p~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:47:43,528 INFO L272 TraceCheckUtils]: 26: Hoare triple {27531#(= main_~p~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,529 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #78#return; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:47:43,529 INFO L272 TraceCheckUtils]: 31: Hoare triple {27531#(= main_~p~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,529 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #80#return; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:47:43,530 INFO L272 TraceCheckUtils]: 36: Hoare triple {27531#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,530 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #82#return; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:47:43,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {27531#(= main_~p~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:47:43,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {27586#(= main_~p~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:47:43,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {27586#(= main_~p~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:47:43,531 INFO L272 TraceCheckUtils]: 44: Hoare triple {27586#(= main_~p~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,531 INFO L290 TraceCheckUtils]: 47: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,532 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #78#return; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:47:43,532 INFO L272 TraceCheckUtils]: 49: Hoare triple {27586#(= main_~p~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,532 INFO L290 TraceCheckUtils]: 50: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,532 INFO L290 TraceCheckUtils]: 51: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,532 INFO L290 TraceCheckUtils]: 52: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,532 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #80#return; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:47:43,532 INFO L272 TraceCheckUtils]: 54: Hoare triple {27586#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,532 INFO L290 TraceCheckUtils]: 55: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,533 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #82#return; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:47:43,533 INFO L290 TraceCheckUtils]: 59: Hoare triple {27586#(= main_~p~0 4)} assume !(~r~0 >= ~d~0); {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:47:43,533 INFO L290 TraceCheckUtils]: 60: Hoare triple {27586#(= main_~p~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:47:43,533 INFO L290 TraceCheckUtils]: 61: Hoare triple {27586#(= main_~p~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:47:43,534 INFO L272 TraceCheckUtils]: 62: Hoare triple {27586#(= main_~p~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,534 INFO L290 TraceCheckUtils]: 63: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,534 INFO L290 TraceCheckUtils]: 64: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,534 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #84#return; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:47:43,534 INFO L272 TraceCheckUtils]: 67: Hoare triple {27586#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,534 INFO L290 TraceCheckUtils]: 68: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,534 INFO L290 TraceCheckUtils]: 69: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,534 INFO L290 TraceCheckUtils]: 70: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,535 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #86#return; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:47:43,535 INFO L290 TraceCheckUtils]: 72: Hoare triple {27586#(= 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); {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:47:43,536 INFO L290 TraceCheckUtils]: 73: Hoare triple {27531#(= main_~p~0 2)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:47:43,536 INFO L290 TraceCheckUtils]: 74: Hoare triple {27531#(= main_~p~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:47:43,536 INFO L290 TraceCheckUtils]: 75: Hoare triple {27531#(= main_~p~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:47:43,536 INFO L272 TraceCheckUtils]: 76: Hoare triple {27531#(= main_~p~0 2)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,536 INFO L290 TraceCheckUtils]: 77: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,536 INFO L290 TraceCheckUtils]: 78: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,536 INFO L290 TraceCheckUtils]: 79: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,537 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #84#return; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:47:43,537 INFO L272 TraceCheckUtils]: 81: Hoare triple {27531#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,537 INFO L290 TraceCheckUtils]: 82: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,537 INFO L290 TraceCheckUtils]: 83: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,537 INFO L290 TraceCheckUtils]: 84: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,537 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #86#return; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:47:43,538 INFO L290 TraceCheckUtils]: 86: Hoare triple {27531#(= 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); {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:47:43,538 INFO L290 TraceCheckUtils]: 87: Hoare triple {27476#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:47:43,538 INFO L290 TraceCheckUtils]: 88: Hoare triple {27476#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:47:43,539 INFO L290 TraceCheckUtils]: 89: Hoare triple {27476#(= main_~p~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:47:43,539 INFO L272 TraceCheckUtils]: 90: Hoare triple {27476#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,539 INFO L290 TraceCheckUtils]: 91: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,539 INFO L290 TraceCheckUtils]: 92: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,539 INFO L290 TraceCheckUtils]: 93: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,539 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #84#return; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:47:43,539 INFO L272 TraceCheckUtils]: 95: Hoare triple {27476#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,539 INFO L290 TraceCheckUtils]: 96: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,540 INFO L290 TraceCheckUtils]: 97: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,540 INFO L290 TraceCheckUtils]: 98: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,540 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #86#return; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:47:43,540 INFO L290 TraceCheckUtils]: 100: Hoare triple {27476#(= 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); {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:47:43,540 INFO L290 TraceCheckUtils]: 101: Hoare triple {27764#(<= main_~p~0 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:47:43,541 INFO L290 TraceCheckUtils]: 102: Hoare triple {27764#(<= main_~p~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:47:43,541 INFO L290 TraceCheckUtils]: 103: Hoare triple {27764#(<= main_~p~0 0)} assume !!(#t~post6 < 20);havoc #t~post6; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:47:43,541 INFO L272 TraceCheckUtils]: 104: Hoare triple {27764#(<= main_~p~0 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,541 INFO L290 TraceCheckUtils]: 105: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,541 INFO L290 TraceCheckUtils]: 106: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,541 INFO L290 TraceCheckUtils]: 107: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,542 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {27456#true} {27764#(<= main_~p~0 0)} #84#return; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:47:43,542 INFO L272 TraceCheckUtils]: 109: Hoare triple {27764#(<= main_~p~0 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:43,542 INFO L290 TraceCheckUtils]: 110: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:43,542 INFO L290 TraceCheckUtils]: 111: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:43,542 INFO L290 TraceCheckUtils]: 112: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:43,542 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {27456#true} {27764#(<= main_~p~0 0)} #86#return; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:47:43,543 INFO L290 TraceCheckUtils]: 114: Hoare triple {27764#(<= main_~p~0 0)} assume !(1 != ~p~0); {27457#false} is VALID [2022-04-27 13:47:43,543 INFO L272 TraceCheckUtils]: 115: Hoare triple {27457#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27457#false} is VALID [2022-04-27 13:47:43,543 INFO L290 TraceCheckUtils]: 116: Hoare triple {27457#false} ~cond := #in~cond; {27457#false} is VALID [2022-04-27 13:47:43,543 INFO L290 TraceCheckUtils]: 117: Hoare triple {27457#false} assume !(0 == ~cond); {27457#false} is VALID [2022-04-27 13:47:43,543 INFO L290 TraceCheckUtils]: 118: Hoare triple {27457#false} assume true; {27457#false} is VALID [2022-04-27 13:47:43,543 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {27457#false} {27457#false} #88#return; {27457#false} is VALID [2022-04-27 13:47:43,543 INFO L272 TraceCheckUtils]: 120: Hoare triple {27457#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {27457#false} is VALID [2022-04-27 13:47:43,543 INFO L290 TraceCheckUtils]: 121: Hoare triple {27457#false} ~cond := #in~cond; {27457#false} is VALID [2022-04-27 13:47:43,543 INFO L290 TraceCheckUtils]: 122: Hoare triple {27457#false} assume 0 == ~cond; {27457#false} is VALID [2022-04-27 13:47:43,543 INFO L290 TraceCheckUtils]: 123: Hoare triple {27457#false} assume !false; {27457#false} is VALID [2022-04-27 13:47:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 102 proven. 51 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2022-04-27 13:47:43,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:47:44,340 INFO L290 TraceCheckUtils]: 123: Hoare triple {27457#false} assume !false; {27457#false} is VALID [2022-04-27 13:47:44,340 INFO L290 TraceCheckUtils]: 122: Hoare triple {27457#false} assume 0 == ~cond; {27457#false} is VALID [2022-04-27 13:47:44,340 INFO L290 TraceCheckUtils]: 121: Hoare triple {27457#false} ~cond := #in~cond; {27457#false} is VALID [2022-04-27 13:47:44,340 INFO L272 TraceCheckUtils]: 120: Hoare triple {27457#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {27457#false} is VALID [2022-04-27 13:47:44,340 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {27456#true} {27457#false} #88#return; {27457#false} is VALID [2022-04-27 13:47:44,340 INFO L290 TraceCheckUtils]: 118: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,340 INFO L290 TraceCheckUtils]: 117: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,341 INFO L290 TraceCheckUtils]: 116: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,341 INFO L272 TraceCheckUtils]: 115: Hoare triple {27457#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,341 INFO L290 TraceCheckUtils]: 114: Hoare triple {27764#(<= main_~p~0 0)} assume !(1 != ~p~0); {27457#false} is VALID [2022-04-27 13:47:44,342 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {27456#true} {27764#(<= main_~p~0 0)} #86#return; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:47:44,342 INFO L290 TraceCheckUtils]: 112: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,342 INFO L290 TraceCheckUtils]: 111: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,342 INFO L290 TraceCheckUtils]: 110: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,342 INFO L272 TraceCheckUtils]: 109: Hoare triple {27764#(<= main_~p~0 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,343 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {27456#true} {27764#(<= main_~p~0 0)} #84#return; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:47:44,343 INFO L290 TraceCheckUtils]: 107: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,343 INFO L290 TraceCheckUtils]: 106: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,343 INFO L290 TraceCheckUtils]: 105: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,343 INFO L272 TraceCheckUtils]: 104: Hoare triple {27764#(<= main_~p~0 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,343 INFO L290 TraceCheckUtils]: 103: Hoare triple {27764#(<= main_~p~0 0)} assume !!(#t~post6 < 20);havoc #t~post6; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:47:44,343 INFO L290 TraceCheckUtils]: 102: Hoare triple {27764#(<= main_~p~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:47:44,344 INFO L290 TraceCheckUtils]: 101: Hoare triple {27764#(<= main_~p~0 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:47:44,345 INFO L290 TraceCheckUtils]: 100: Hoare triple {27903#(<= (div 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); {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:47:44,345 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27456#true} {27903#(<= (div main_~p~0 2) 0)} #86#return; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:47:44,345 INFO L290 TraceCheckUtils]: 98: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,345 INFO L290 TraceCheckUtils]: 97: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,345 INFO L290 TraceCheckUtils]: 96: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,345 INFO L272 TraceCheckUtils]: 95: Hoare triple {27903#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,346 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27456#true} {27903#(<= (div main_~p~0 2) 0)} #84#return; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:47:44,346 INFO L290 TraceCheckUtils]: 93: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,346 INFO L290 TraceCheckUtils]: 92: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,346 INFO L290 TraceCheckUtils]: 91: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,346 INFO L272 TraceCheckUtils]: 90: Hoare triple {27903#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,346 INFO L290 TraceCheckUtils]: 89: Hoare triple {27903#(<= (div main_~p~0 2) 0)} assume !!(#t~post6 < 20);havoc #t~post6; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:47:44,346 INFO L290 TraceCheckUtils]: 88: Hoare triple {27903#(<= (div main_~p~0 2) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:47:44,347 INFO L290 TraceCheckUtils]: 87: Hoare triple {27903#(<= (div main_~p~0 2) 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:47:44,348 INFO L290 TraceCheckUtils]: 86: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 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); {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:47:44,348 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27456#true} {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #86#return; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:47:44,348 INFO L290 TraceCheckUtils]: 84: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,348 INFO L290 TraceCheckUtils]: 83: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,348 INFO L290 TraceCheckUtils]: 82: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,348 INFO L272 TraceCheckUtils]: 81: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,349 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27456#true} {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #84#return; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:47:44,349 INFO L290 TraceCheckUtils]: 79: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,349 INFO L290 TraceCheckUtils]: 78: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,349 INFO L290 TraceCheckUtils]: 77: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,349 INFO L272 TraceCheckUtils]: 76: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,349 INFO L290 TraceCheckUtils]: 75: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} assume !!(#t~post6 < 20);havoc #t~post6; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:47:44,350 INFO L290 TraceCheckUtils]: 74: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:47:44,350 INFO L290 TraceCheckUtils]: 73: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:47:44,351 INFO L290 TraceCheckUtils]: 72: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 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); {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:47:44,351 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27456#true} {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #86#return; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:47:44,351 INFO L290 TraceCheckUtils]: 70: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,351 INFO L290 TraceCheckUtils]: 69: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,351 INFO L290 TraceCheckUtils]: 68: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,352 INFO L272 TraceCheckUtils]: 67: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,352 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27456#true} {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #84#return; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:47:44,352 INFO L290 TraceCheckUtils]: 65: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,352 INFO L272 TraceCheckUtils]: 62: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,352 INFO L290 TraceCheckUtils]: 61: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} assume !!(#t~post6 < 20);havoc #t~post6; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:47:44,353 INFO L290 TraceCheckUtils]: 60: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:47:44,353 INFO L290 TraceCheckUtils]: 59: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} assume !(~r~0 >= ~d~0); {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:47:44,353 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27456#true} {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #82#return; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:47:44,353 INFO L290 TraceCheckUtils]: 57: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,354 INFO L290 TraceCheckUtils]: 56: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,354 INFO L290 TraceCheckUtils]: 55: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,354 INFO L272 TraceCheckUtils]: 54: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,354 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27456#true} {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #80#return; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:47:44,354 INFO L290 TraceCheckUtils]: 52: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,354 INFO L290 TraceCheckUtils]: 51: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,354 INFO L290 TraceCheckUtils]: 50: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,354 INFO L272 TraceCheckUtils]: 49: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,355 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27456#true} {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #78#return; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:47:44,355 INFO L290 TraceCheckUtils]: 47: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,355 INFO L290 TraceCheckUtils]: 46: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,355 INFO L290 TraceCheckUtils]: 45: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,355 INFO L272 TraceCheckUtils]: 44: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,355 INFO L290 TraceCheckUtils]: 43: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} assume !!(#t~post5 < 20);havoc #t~post5; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:47:44,355 INFO L290 TraceCheckUtils]: 42: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:47:44,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:47:44,357 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27456#true} {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #82#return; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:47:44,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,357 INFO L272 TraceCheckUtils]: 36: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,357 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27456#true} {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #80#return; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:47:44,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,358 INFO L272 TraceCheckUtils]: 31: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,358 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27456#true} {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #78#return; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:47:44,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,358 INFO L272 TraceCheckUtils]: 26: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} assume !!(#t~post5 < 20);havoc #t~post5; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:47:44,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:47:44,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {27903#(<= (div main_~p~0 2) 0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:47:44,360 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27456#true} {27903#(<= (div main_~p~0 2) 0)} #82#return; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:47:44,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,360 INFO L272 TraceCheckUtils]: 18: Hoare triple {27903#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,360 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27456#true} {27903#(<= (div main_~p~0 2) 0)} #80#return; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:47:44,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,361 INFO L272 TraceCheckUtils]: 13: Hoare triple {27903#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,361 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27456#true} {27903#(<= (div main_~p~0 2) 0)} #78#return; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:47:44,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:47:44,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:47:44,361 INFO L272 TraceCheckUtils]: 8: Hoare triple {27903#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:47:44,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {27903#(<= (div main_~p~0 2) 0)} assume !!(#t~post5 < 20);havoc #t~post5; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:47:44,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {27903#(<= (div main_~p~0 2) 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:47:44,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {27456#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:47:44,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {27456#true} call #t~ret7 := main(); {27456#true} is VALID [2022-04-27 13:47:44,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27456#true} {27456#true} #92#return; {27456#true} is VALID [2022-04-27 13:47:44,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:47:44,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {27456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27456#true} is VALID [2022-04-27 13:47:44,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {27456#true} call ULTIMATE.init(); {27456#true} is VALID [2022-04-27 13:47:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 69 proven. 18 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-04-27 13:47:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:47:44,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186058600] [2022-04-27 13:47:44,363 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:47:44,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903148057] [2022-04-27 13:47:44,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903148057] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:47:44,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:47:44,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 13:47:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097795971] [2022-04-27 13:47:44,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:47:44,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) Word has length 124 [2022-04-27 13:47:44,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:47:44,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2022-04-27 13:47:44,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:44,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:47:44,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:47:44,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:47:44,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:47:44,468 INFO L87 Difference]: Start difference. First operand 1097 states and 1455 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2022-04-27 13:47:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:45,507 INFO L93 Difference]: Finished difference Result 1320 states and 1738 transitions. [2022-04-27 13:47:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:47:45,507 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) Word has length 124 [2022-04-27 13:47:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:47:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2022-04-27 13:47:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-04-27 13:47:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2022-04-27 13:47:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-04-27 13:47:45,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2022-04-27 13:47:45,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:47:45,612 INFO L225 Difference]: With dead ends: 1320 [2022-04-27 13:47:45,613 INFO L226 Difference]: Without dead ends: 907 [2022-04-27 13:47:45,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:47:45,614 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:47:45,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 217 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:47:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-27 13:47:46,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 905. [2022-04-27 13:47:46,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:47:46,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 905 states, 598 states have (on average 1.2040133779264215) internal successors, (720), 627 states have internal predecessors, (720), 221 states have call successors, (221), 87 states have call predecessors, (221), 85 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) [2022-04-27 13:47:46,150 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 905 states, 598 states have (on average 1.2040133779264215) internal successors, (720), 627 states have internal predecessors, (720), 221 states have call successors, (221), 87 states have call predecessors, (221), 85 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) [2022-04-27 13:47:46,150 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 905 states, 598 states have (on average 1.2040133779264215) internal successors, (720), 627 states have internal predecessors, (720), 221 states have call successors, (221), 87 states have call predecessors, (221), 85 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) [2022-04-27 13:47:46,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:46,175 INFO L93 Difference]: Finished difference Result 907 states and 1156 transitions. [2022-04-27 13:47:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1156 transitions. [2022-04-27 13:47:46,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:46,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:46,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 598 states have (on average 1.2040133779264215) internal successors, (720), 627 states have internal predecessors, (720), 221 states have call successors, (221), 87 states have call predecessors, (221), 85 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) Second operand 907 states. [2022-04-27 13:47:46,179 INFO L87 Difference]: Start difference. First operand has 905 states, 598 states have (on average 1.2040133779264215) internal successors, (720), 627 states have internal predecessors, (720), 221 states have call successors, (221), 87 states have call predecessors, (221), 85 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) Second operand 907 states. [2022-04-27 13:47:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:47:46,205 INFO L93 Difference]: Finished difference Result 907 states and 1156 transitions. [2022-04-27 13:47:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1156 transitions. [2022-04-27 13:47:46,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:47:46,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:47:46,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:47:46,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:47:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 598 states have (on average 1.2040133779264215) internal successors, (720), 627 states have internal predecessors, (720), 221 states have call successors, (221), 87 states have call predecessors, (221), 85 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) [2022-04-27 13:47:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1153 transitions. [2022-04-27 13:47:46,240 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1153 transitions. Word has length 124 [2022-04-27 13:47:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:47:46,241 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1153 transitions. [2022-04-27 13:47:46,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2022-04-27 13:47:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1153 transitions. [2022-04-27 13:47:46,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-27 13:47:46,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:47:46,242 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:47:46,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 13:47:46,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:46,467 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:47:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:47:46,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1372095454, now seen corresponding path program 3 times [2022-04-27 13:47:46,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:47:46,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999750432] [2022-04-27 13:47:46,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:47:46,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:47:46,479 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:47:46,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [895565616] [2022-04-27 13:47:46,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:47:46,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:47:46,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:47:46,481 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:47:46,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 13:47:46,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 13:47:46,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:47:46,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 13:47:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:47:46,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:47:51,797 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:47:54,809 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:48:03,570 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:48:03,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {33033#true} call ULTIMATE.init(); {33033#true} is VALID [2022-04-27 13:48:03,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {33033#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33033#true} is VALID [2022-04-27 13:48:03,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33033#true} {33033#true} #92#return; {33033#true} is VALID [2022-04-27 13:48:03,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {33033#true} call #t~ret7 := main(); {33033#true} is VALID [2022-04-27 13:48:03,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {33033#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {33053#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,875 INFO L272 TraceCheckUtils]: 8: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,876 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #78#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,876 INFO L272 TraceCheckUtils]: 13: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,877 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #80#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,877 INFO L272 TraceCheckUtils]: 18: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,877 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #82#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {33053#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {33053#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,878 INFO L272 TraceCheckUtils]: 26: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,879 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #78#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,879 INFO L272 TraceCheckUtils]: 31: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,879 INFO L290 TraceCheckUtils]: 32: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,879 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #80#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,879 INFO L272 TraceCheckUtils]: 36: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,880 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #82#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,880 INFO L290 TraceCheckUtils]: 41: Hoare triple {33053#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {33053#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,881 INFO L290 TraceCheckUtils]: 43: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,881 INFO L272 TraceCheckUtils]: 44: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,881 INFO L290 TraceCheckUtils]: 45: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,881 INFO L290 TraceCheckUtils]: 47: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,881 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #78#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,882 INFO L272 TraceCheckUtils]: 49: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,882 INFO L290 TraceCheckUtils]: 50: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,882 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #80#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,882 INFO L272 TraceCheckUtils]: 54: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,883 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #82#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,883 INFO L290 TraceCheckUtils]: 59: Hoare triple {33053#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,883 INFO L290 TraceCheckUtils]: 60: Hoare triple {33053#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,884 INFO L290 TraceCheckUtils]: 61: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,884 INFO L272 TraceCheckUtils]: 62: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,884 INFO L290 TraceCheckUtils]: 63: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,884 INFO L290 TraceCheckUtils]: 64: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,884 INFO L290 TraceCheckUtils]: 65: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,884 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #78#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,884 INFO L272 TraceCheckUtils]: 67: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,884 INFO L290 TraceCheckUtils]: 68: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,884 INFO L290 TraceCheckUtils]: 69: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,884 INFO L290 TraceCheckUtils]: 70: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,885 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #80#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,885 INFO L272 TraceCheckUtils]: 72: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,885 INFO L290 TraceCheckUtils]: 73: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,885 INFO L290 TraceCheckUtils]: 74: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,885 INFO L290 TraceCheckUtils]: 75: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,885 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #82#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,886 INFO L290 TraceCheckUtils]: 77: Hoare triple {33053#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,886 INFO L290 TraceCheckUtils]: 78: Hoare triple {33053#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,886 INFO L290 TraceCheckUtils]: 79: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,886 INFO L272 TraceCheckUtils]: 80: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,886 INFO L290 TraceCheckUtils]: 81: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,886 INFO L290 TraceCheckUtils]: 82: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,887 INFO L290 TraceCheckUtils]: 83: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,887 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #84#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,887 INFO L272 TraceCheckUtils]: 85: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,887 INFO L290 TraceCheckUtils]: 86: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,887 INFO L290 TraceCheckUtils]: 87: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,887 INFO L290 TraceCheckUtils]: 88: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,888 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #86#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,888 INFO L290 TraceCheckUtils]: 90: Hoare triple {33053#(= main_~B~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); {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,888 INFO L290 TraceCheckUtils]: 91: Hoare triple {33053#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,888 INFO L290 TraceCheckUtils]: 92: Hoare triple {33053#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,889 INFO L290 TraceCheckUtils]: 93: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,889 INFO L272 TraceCheckUtils]: 94: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,889 INFO L290 TraceCheckUtils]: 95: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,889 INFO L290 TraceCheckUtils]: 96: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,889 INFO L290 TraceCheckUtils]: 97: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,889 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #84#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,890 INFO L272 TraceCheckUtils]: 99: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,890 INFO L290 TraceCheckUtils]: 100: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:48:03,890 INFO L290 TraceCheckUtils]: 101: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:48:03,890 INFO L290 TraceCheckUtils]: 102: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:48:03,890 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #86#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,890 INFO L290 TraceCheckUtils]: 104: Hoare triple {33053#(= main_~B~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); {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,891 INFO L290 TraceCheckUtils]: 105: Hoare triple {33053#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,891 INFO L290 TraceCheckUtils]: 106: Hoare triple {33053#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,891 INFO L290 TraceCheckUtils]: 107: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:48:03,891 INFO L272 TraceCheckUtils]: 108: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,892 INFO L290 TraceCheckUtils]: 109: Hoare triple {33033#true} ~cond := #in~cond; {33366#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:48:03,892 INFO L290 TraceCheckUtils]: 110: Hoare triple {33366#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:48:03,892 INFO L290 TraceCheckUtils]: 111: Hoare triple {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:48:03,893 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} {33053#(= main_~B~0 1)} #84#return; {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:48:03,893 INFO L272 TraceCheckUtils]: 113: Hoare triple {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:48:03,893 INFO L290 TraceCheckUtils]: 114: Hoare triple {33033#true} ~cond := #in~cond; {33366#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:48:03,893 INFO L290 TraceCheckUtils]: 115: Hoare triple {33366#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:48:03,894 INFO L290 TraceCheckUtils]: 116: Hoare triple {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:48:03,894 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #86#return; {33393#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:48:03,896 INFO L290 TraceCheckUtils]: 118: Hoare triple {33393#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~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); {33393#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:48:03,897 INFO L290 TraceCheckUtils]: 119: Hoare triple {33393#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:48:03,897 INFO L290 TraceCheckUtils]: 120: Hoare triple {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:48:03,897 INFO L290 TraceCheckUtils]: 121: Hoare triple {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} assume !!(#t~post6 < 20);havoc #t~post6; {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:48:03,898 INFO L272 TraceCheckUtils]: 122: Hoare triple {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {33409#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:48:03,898 INFO L290 TraceCheckUtils]: 123: Hoare triple {33409#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33413#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:48:03,899 INFO L290 TraceCheckUtils]: 124: Hoare triple {33413#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33034#false} is VALID [2022-04-27 13:48:03,899 INFO L290 TraceCheckUtils]: 125: Hoare triple {33034#false} assume !false; {33034#false} is VALID [2022-04-27 13:48:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 145 proven. 2 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2022-04-27 13:48:03,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:48:36,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:48:36,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999750432] [2022-04-27 13:48:36,091 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:48:36,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895565616] [2022-04-27 13:48:36,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895565616] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:48:36,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:48:36,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 13:48:36,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424276441] [2022-04-27 13:48:36,091 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:48:36,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 126 [2022-04-27 13:48:36,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:48:36,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:48:36,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:48:36,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:48:36,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:48:36,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:48:36,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:48:36,125 INFO L87 Difference]: Start difference. First operand 905 states and 1153 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:48:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:48:37,026 INFO L93 Difference]: Finished difference Result 935 states and 1182 transitions. [2022-04-27 13:48:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:48:37,026 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 126 [2022-04-27 13:48:37,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:48:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:48:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-27 13:48:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:48:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-27 13:48:37,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2022-04-27 13:48:37,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:48:37,098 INFO L225 Difference]: With dead ends: 935 [2022-04-27 13:48:37,098 INFO L226 Difference]: Without dead ends: 921 [2022-04-27 13:48:37,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-27 13:48:37,099 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:48:37,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 90 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:48:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-04-27 13:48:37,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 695. [2022-04-27 13:48:37,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:48:37,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 921 states. Second operand has 695 states, 468 states have (on average 1.1752136752136753) internal successors, (550), 470 states have internal predecessors, (550), 153 states have call successors, (153), 75 states have call predecessors, (153), 73 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 13:48:37,556 INFO L74 IsIncluded]: Start isIncluded. First operand 921 states. Second operand has 695 states, 468 states have (on average 1.1752136752136753) internal successors, (550), 470 states have internal predecessors, (550), 153 states have call successors, (153), 75 states have call predecessors, (153), 73 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 13:48:37,557 INFO L87 Difference]: Start difference. First operand 921 states. Second operand has 695 states, 468 states have (on average 1.1752136752136753) internal successors, (550), 470 states have internal predecessors, (550), 153 states have call successors, (153), 75 states have call predecessors, (153), 73 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 13:48:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:48:37,583 INFO L93 Difference]: Finished difference Result 921 states and 1162 transitions. [2022-04-27 13:48:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1162 transitions. [2022-04-27 13:48:37,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:48:37,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:48:37,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 695 states, 468 states have (on average 1.1752136752136753) internal successors, (550), 470 states have internal predecessors, (550), 153 states have call successors, (153), 75 states have call predecessors, (153), 73 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) Second operand 921 states. [2022-04-27 13:48:37,586 INFO L87 Difference]: Start difference. First operand has 695 states, 468 states have (on average 1.1752136752136753) internal successors, (550), 470 states have internal predecessors, (550), 153 states have call successors, (153), 75 states have call predecessors, (153), 73 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) Second operand 921 states. [2022-04-27 13:48:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:48:37,612 INFO L93 Difference]: Finished difference Result 921 states and 1162 transitions. [2022-04-27 13:48:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1162 transitions. [2022-04-27 13:48:37,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:48:37,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:48:37,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:48:37,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:48:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 468 states have (on average 1.1752136752136753) internal successors, (550), 470 states have internal predecessors, (550), 153 states have call successors, (153), 75 states have call predecessors, (153), 73 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 13:48:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 853 transitions. [2022-04-27 13:48:37,635 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 853 transitions. Word has length 126 [2022-04-27 13:48:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:48:37,635 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 853 transitions. [2022-04-27 13:48:37,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:48:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 853 transitions. [2022-04-27 13:48:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-27 13:48:37,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:48:37,637 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:48:37,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 13:48:37,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:48:37,851 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:48:37,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:48:37,852 INFO L85 PathProgramCache]: Analyzing trace with hash 388866286, now seen corresponding path program 3 times [2022-04-27 13:48:37,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:48:37,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855218546] [2022-04-27 13:48:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:48:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:48:37,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:48:37,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [63226326] [2022-04-27 13:48:37,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:48:37,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:48:37,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:48:37,864 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:48:37,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 13:48:37,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 13:48:37,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:48:37,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 13:48:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:48:37,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:48:38,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {37497#true} call ULTIMATE.init(); {37497#true} is VALID [2022-04-27 13:48:38,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {37497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37497#true} is VALID [2022-04-27 13:48:38,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37497#true} {37497#true} #92#return; {37497#true} is VALID [2022-04-27 13:48:38,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {37497#true} call #t~ret7 := main(); {37497#true} is VALID [2022-04-27 13:48:38,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {37497#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {37517#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {37517#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,227 INFO L272 TraceCheckUtils]: 8: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,230 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #78#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,230 INFO L272 TraceCheckUtils]: 13: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,231 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #80#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,231 INFO L272 TraceCheckUtils]: 18: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,231 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #82#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {37517#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {37517#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {37517#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,232 INFO L272 TraceCheckUtils]: 26: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,233 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #78#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,233 INFO L272 TraceCheckUtils]: 31: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,233 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #80#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,233 INFO L272 TraceCheckUtils]: 36: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,234 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #82#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,234 INFO L290 TraceCheckUtils]: 41: Hoare triple {37517#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,234 INFO L290 TraceCheckUtils]: 42: Hoare triple {37517#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {37517#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,235 INFO L272 TraceCheckUtils]: 44: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,235 INFO L290 TraceCheckUtils]: 45: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,235 INFO L290 TraceCheckUtils]: 46: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,235 INFO L290 TraceCheckUtils]: 47: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,235 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #78#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,235 INFO L272 TraceCheckUtils]: 49: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,235 INFO L290 TraceCheckUtils]: 51: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,235 INFO L290 TraceCheckUtils]: 52: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,236 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #80#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,236 INFO L272 TraceCheckUtils]: 54: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,236 INFO L290 TraceCheckUtils]: 55: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,236 INFO L290 TraceCheckUtils]: 56: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,236 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #82#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,237 INFO L290 TraceCheckUtils]: 59: Hoare triple {37517#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,237 INFO L290 TraceCheckUtils]: 60: Hoare triple {37517#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {37517#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,237 INFO L272 TraceCheckUtils]: 62: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,237 INFO L290 TraceCheckUtils]: 63: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,237 INFO L290 TraceCheckUtils]: 64: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,237 INFO L290 TraceCheckUtils]: 65: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,238 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #78#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,238 INFO L272 TraceCheckUtils]: 67: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,238 INFO L290 TraceCheckUtils]: 68: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,238 INFO L290 TraceCheckUtils]: 69: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,238 INFO L290 TraceCheckUtils]: 70: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,238 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #80#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,238 INFO L272 TraceCheckUtils]: 72: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,239 INFO L290 TraceCheckUtils]: 73: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,239 INFO L290 TraceCheckUtils]: 74: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,239 INFO L290 TraceCheckUtils]: 75: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,249 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #82#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,249 INFO L290 TraceCheckUtils]: 77: Hoare triple {37517#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,249 INFO L290 TraceCheckUtils]: 78: Hoare triple {37517#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,250 INFO L290 TraceCheckUtils]: 79: Hoare triple {37517#(= main_~B~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,250 INFO L272 TraceCheckUtils]: 80: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,250 INFO L290 TraceCheckUtils]: 81: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,250 INFO L290 TraceCheckUtils]: 82: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,250 INFO L290 TraceCheckUtils]: 83: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,259 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #84#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,260 INFO L272 TraceCheckUtils]: 85: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,260 INFO L290 TraceCheckUtils]: 86: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,260 INFO L290 TraceCheckUtils]: 87: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,260 INFO L290 TraceCheckUtils]: 88: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,260 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #86#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,260 INFO L290 TraceCheckUtils]: 90: Hoare triple {37517#(= main_~B~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); {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,261 INFO L290 TraceCheckUtils]: 91: Hoare triple {37517#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,261 INFO L290 TraceCheckUtils]: 92: Hoare triple {37517#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,261 INFO L290 TraceCheckUtils]: 93: Hoare triple {37517#(= main_~B~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,261 INFO L272 TraceCheckUtils]: 94: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,261 INFO L290 TraceCheckUtils]: 95: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,261 INFO L290 TraceCheckUtils]: 96: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,261 INFO L290 TraceCheckUtils]: 97: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,262 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #84#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,262 INFO L272 TraceCheckUtils]: 99: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,262 INFO L290 TraceCheckUtils]: 100: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,262 INFO L290 TraceCheckUtils]: 101: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,262 INFO L290 TraceCheckUtils]: 102: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,263 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #86#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,263 INFO L290 TraceCheckUtils]: 104: Hoare triple {37517#(= main_~B~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); {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,263 INFO L290 TraceCheckUtils]: 105: Hoare triple {37517#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,263 INFO L290 TraceCheckUtils]: 106: Hoare triple {37517#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,264 INFO L290 TraceCheckUtils]: 107: Hoare triple {37517#(= main_~B~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,264 INFO L272 TraceCheckUtils]: 108: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,264 INFO L290 TraceCheckUtils]: 109: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,264 INFO L290 TraceCheckUtils]: 110: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,264 INFO L290 TraceCheckUtils]: 111: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,264 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #84#return; {37517#(= main_~B~0 1)} is VALID [2022-04-27 13:48:38,264 INFO L272 TraceCheckUtils]: 113: Hoare triple {37517#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,265 INFO L290 TraceCheckUtils]: 114: Hoare triple {37497#true} ~cond := #in~cond; {37845#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:48:38,265 INFO L290 TraceCheckUtils]: 115: Hoare triple {37845#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {37849#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:48:38,265 INFO L290 TraceCheckUtils]: 116: Hoare triple {37849#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {37849#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:48:38,266 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {37849#(not (= |__VERIFIER_assert_#in~cond| 0))} {37517#(= main_~B~0 1)} #86#return; {37856#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1))} is VALID [2022-04-27 13:48:38,266 INFO L290 TraceCheckUtils]: 118: Hoare triple {37856#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1))} assume !(1 != ~p~0); {37860#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:48:38,266 INFO L272 TraceCheckUtils]: 119: Hoare triple {37860#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:38,266 INFO L290 TraceCheckUtils]: 120: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:38,266 INFO L290 TraceCheckUtils]: 121: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:38,266 INFO L290 TraceCheckUtils]: 122: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:38,267 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {37497#true} {37860#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} #88#return; {37860#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:48:38,267 INFO L272 TraceCheckUtils]: 124: Hoare triple {37860#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {37879#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:48:38,267 INFO L290 TraceCheckUtils]: 125: Hoare triple {37879#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37883#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:48:38,268 INFO L290 TraceCheckUtils]: 126: Hoare triple {37883#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37498#false} is VALID [2022-04-27 13:48:38,268 INFO L290 TraceCheckUtils]: 127: Hoare triple {37498#false} assume !false; {37498#false} is VALID [2022-04-27 13:48:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 90 proven. 4 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2022-04-27 13:48:38,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:48:40,885 INFO L290 TraceCheckUtils]: 127: Hoare triple {37498#false} assume !false; {37498#false} is VALID [2022-04-27 13:48:40,885 INFO L290 TraceCheckUtils]: 126: Hoare triple {37883#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37498#false} is VALID [2022-04-27 13:48:40,886 INFO L290 TraceCheckUtils]: 125: Hoare triple {37879#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37883#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:48:40,886 INFO L272 TraceCheckUtils]: 124: Hoare triple {37899#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {37879#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:48:40,887 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {37497#true} {37899#(= main_~B~0 main_~d~0)} #88#return; {37899#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:48:40,887 INFO L290 TraceCheckUtils]: 122: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,887 INFO L290 TraceCheckUtils]: 121: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,887 INFO L290 TraceCheckUtils]: 120: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,887 INFO L272 TraceCheckUtils]: 119: Hoare triple {37899#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,887 INFO L290 TraceCheckUtils]: 118: Hoare triple {37918#(or (not (= main_~p~0 1)) (= main_~B~0 main_~d~0))} assume !(1 != ~p~0); {37899#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:48:40,888 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {37849#(not (= |__VERIFIER_assert_#in~cond| 0))} {37497#true} #86#return; {37918#(or (not (= main_~p~0 1)) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:48:40,888 INFO L290 TraceCheckUtils]: 116: Hoare triple {37849#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {37849#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:48:40,889 INFO L290 TraceCheckUtils]: 115: Hoare triple {37931#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {37849#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:48:40,889 INFO L290 TraceCheckUtils]: 114: Hoare triple {37497#true} ~cond := #in~cond; {37931#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:48:40,889 INFO L272 TraceCheckUtils]: 113: Hoare triple {37497#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,889 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {37497#true} {37497#true} #84#return; {37497#true} is VALID [2022-04-27 13:48:40,889 INFO L290 TraceCheckUtils]: 111: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,889 INFO L290 TraceCheckUtils]: 110: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,889 INFO L290 TraceCheckUtils]: 109: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,889 INFO L272 TraceCheckUtils]: 108: Hoare triple {37497#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,889 INFO L290 TraceCheckUtils]: 107: Hoare triple {37497#true} assume !!(#t~post6 < 20);havoc #t~post6; {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L290 TraceCheckUtils]: 106: Hoare triple {37497#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L290 TraceCheckUtils]: 105: Hoare triple {37497#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L290 TraceCheckUtils]: 104: Hoare triple {37497#true} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {37497#true} {37497#true} #86#return; {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L290 TraceCheckUtils]: 102: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L290 TraceCheckUtils]: 101: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L290 TraceCheckUtils]: 100: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L272 TraceCheckUtils]: 99: Hoare triple {37497#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {37497#true} {37497#true} #84#return; {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L290 TraceCheckUtils]: 97: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L290 TraceCheckUtils]: 96: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L290 TraceCheckUtils]: 95: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L272 TraceCheckUtils]: 94: Hoare triple {37497#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L290 TraceCheckUtils]: 93: Hoare triple {37497#true} assume !!(#t~post6 < 20);havoc #t~post6; {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L290 TraceCheckUtils]: 92: Hoare triple {37497#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L290 TraceCheckUtils]: 91: Hoare triple {37497#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {37497#true} is VALID [2022-04-27 13:48:40,890 INFO L290 TraceCheckUtils]: 90: Hoare triple {37497#true} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {37497#true} {37497#true} #86#return; {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L290 TraceCheckUtils]: 88: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L290 TraceCheckUtils]: 87: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L290 TraceCheckUtils]: 86: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L272 TraceCheckUtils]: 85: Hoare triple {37497#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {37497#true} {37497#true} #84#return; {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L290 TraceCheckUtils]: 83: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L290 TraceCheckUtils]: 82: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L290 TraceCheckUtils]: 81: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L272 TraceCheckUtils]: 80: Hoare triple {37497#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L290 TraceCheckUtils]: 79: Hoare triple {37497#true} assume !!(#t~post6 < 20);havoc #t~post6; {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L290 TraceCheckUtils]: 78: Hoare triple {37497#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L290 TraceCheckUtils]: 77: Hoare triple {37497#true} assume !(~r~0 >= ~d~0); {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37497#true} {37497#true} #82#return; {37497#true} is VALID [2022-04-27 13:48:40,891 INFO L290 TraceCheckUtils]: 75: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L290 TraceCheckUtils]: 74: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L290 TraceCheckUtils]: 73: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L272 TraceCheckUtils]: 72: Hoare triple {37497#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37497#true} {37497#true} #80#return; {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L290 TraceCheckUtils]: 70: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L290 TraceCheckUtils]: 69: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L290 TraceCheckUtils]: 68: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L272 TraceCheckUtils]: 67: Hoare triple {37497#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {37497#true} {37497#true} #78#return; {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L290 TraceCheckUtils]: 65: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L290 TraceCheckUtils]: 63: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L272 TraceCheckUtils]: 62: Hoare triple {37497#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {37497#true} assume !!(#t~post5 < 20);havoc #t~post5; {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L290 TraceCheckUtils]: 60: Hoare triple {37497#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37497#true} is VALID [2022-04-27 13:48:40,892 INFO L290 TraceCheckUtils]: 59: Hoare triple {37497#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {37497#true} {37497#true} #82#return; {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L290 TraceCheckUtils]: 57: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L290 TraceCheckUtils]: 56: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L290 TraceCheckUtils]: 55: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L272 TraceCheckUtils]: 54: Hoare triple {37497#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37497#true} {37497#true} #80#return; {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L290 TraceCheckUtils]: 52: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L272 TraceCheckUtils]: 49: Hoare triple {37497#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {37497#true} {37497#true} #78#return; {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L290 TraceCheckUtils]: 47: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L290 TraceCheckUtils]: 46: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L290 TraceCheckUtils]: 45: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L272 TraceCheckUtils]: 44: Hoare triple {37497#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {37497#true} assume !!(#t~post5 < 20);havoc #t~post5; {37497#true} is VALID [2022-04-27 13:48:40,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {37497#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L290 TraceCheckUtils]: 41: Hoare triple {37497#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {37497#true} {37497#true} #82#return; {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L272 TraceCheckUtils]: 36: Hoare triple {37497#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {37497#true} {37497#true} #80#return; {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L272 TraceCheckUtils]: 31: Hoare triple {37497#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {37497#true} {37497#true} #78#return; {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,894 INFO L272 TraceCheckUtils]: 26: Hoare triple {37497#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {37497#true} assume !!(#t~post5 < 20);havoc #t~post5; {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {37497#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {37497#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {37497#true} {37497#true} #82#return; {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L272 TraceCheckUtils]: 18: Hoare triple {37497#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37497#true} {37497#true} #80#return; {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L272 TraceCheckUtils]: 13: Hoare triple {37497#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {37497#true} {37497#true} #78#return; {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-27 13:48:40,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-27 13:48:40,896 INFO L272 TraceCheckUtils]: 8: Hoare triple {37497#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37497#true} is VALID [2022-04-27 13:48:40,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {37497#true} assume !!(#t~post5 < 20);havoc #t~post5; {37497#true} is VALID [2022-04-27 13:48:40,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {37497#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37497#true} is VALID [2022-04-27 13:48:40,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {37497#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {37497#true} is VALID [2022-04-27 13:48:40,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {37497#true} call #t~ret7 := main(); {37497#true} is VALID [2022-04-27 13:48:40,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37497#true} {37497#true} #92#return; {37497#true} is VALID [2022-04-27 13:48:40,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-27 13:48:40,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {37497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37497#true} is VALID [2022-04-27 13:48:40,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {37497#true} call ULTIMATE.init(); {37497#true} is VALID [2022-04-27 13:48:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 90 proven. 4 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2022-04-27 13:48:40,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:48:40,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855218546] [2022-04-27 13:48:40,897 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:48:40,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63226326] [2022-04-27 13:48:40,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63226326] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:48:40,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:48:40,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-27 13:48:40,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701831118] [2022-04-27 13:48:40,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:48:40,898 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2022-04-27 13:48:40,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:48:40,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-27 13:48:40,949 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:48:40,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 13:48:40,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:48:40,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 13:48:40,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:48:40,951 INFO L87 Difference]: Start difference. First operand 695 states and 853 transitions. Second operand has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-27 13:48:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:48:41,819 INFO L93 Difference]: Finished difference Result 771 states and 912 transitions. [2022-04-27 13:48:41,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:48:41,819 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2022-04-27 13:48:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:48:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-27 13:48:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-27 13:48:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-27 13:48:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-27 13:48:41,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-27 13:48:41,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:48:41,886 INFO L225 Difference]: With dead ends: 771 [2022-04-27 13:48:41,886 INFO L226 Difference]: Without dead ends: 755 [2022-04-27 13:48:41,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-27 13:48:41,887 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 41 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:48:41,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 94 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:48:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-04-27 13:48:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 539. [2022-04-27 13:48:42,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:48:42,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 755 states. Second operand has 539 states, 362 states have (on average 1.1049723756906078) internal successors, (400), 373 states have internal predecessors, (400), 103 states have call successors, (103), 74 states have call predecessors, (103), 73 states have return successors, (101), 91 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 13:48:42,274 INFO L74 IsIncluded]: Start isIncluded. First operand 755 states. Second operand has 539 states, 362 states have (on average 1.1049723756906078) internal successors, (400), 373 states have internal predecessors, (400), 103 states have call successors, (103), 74 states have call predecessors, (103), 73 states have return successors, (101), 91 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 13:48:42,274 INFO L87 Difference]: Start difference. First operand 755 states. Second operand has 539 states, 362 states have (on average 1.1049723756906078) internal successors, (400), 373 states have internal predecessors, (400), 103 states have call successors, (103), 74 states have call predecessors, (103), 73 states have return successors, (101), 91 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 13:48:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:48:42,291 INFO L93 Difference]: Finished difference Result 755 states and 872 transitions. [2022-04-27 13:48:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 872 transitions. [2022-04-27 13:48:42,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:48:42,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:48:42,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 539 states, 362 states have (on average 1.1049723756906078) internal successors, (400), 373 states have internal predecessors, (400), 103 states have call successors, (103), 74 states have call predecessors, (103), 73 states have return successors, (101), 91 states have call predecessors, (101), 101 states have call successors, (101) Second operand 755 states. [2022-04-27 13:48:42,294 INFO L87 Difference]: Start difference. First operand has 539 states, 362 states have (on average 1.1049723756906078) internal successors, (400), 373 states have internal predecessors, (400), 103 states have call successors, (103), 74 states have call predecessors, (103), 73 states have return successors, (101), 91 states have call predecessors, (101), 101 states have call successors, (101) Second operand 755 states. [2022-04-27 13:48:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:48:42,311 INFO L93 Difference]: Finished difference Result 755 states and 872 transitions. [2022-04-27 13:48:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 872 transitions. [2022-04-27 13:48:42,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:48:42,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:48:42,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:48:42,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:48:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 362 states have (on average 1.1049723756906078) internal successors, (400), 373 states have internal predecessors, (400), 103 states have call successors, (103), 74 states have call predecessors, (103), 73 states have return successors, (101), 91 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 13:48:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 604 transitions. [2022-04-27 13:48:42,326 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 604 transitions. Word has length 128 [2022-04-27 13:48:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:48:42,327 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 604 transitions. [2022-04-27 13:48:42,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-27 13:48:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 604 transitions. [2022-04-27 13:48:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-04-27 13:48:42,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:48:42,329 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 32, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:48:42,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 13:48:42,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:48:42,546 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:48:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:48:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1492475124, now seen corresponding path program 2 times [2022-04-27 13:48:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:48:42,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719314688] [2022-04-27 13:48:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:48:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:48:42,565 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:48:42,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [21168090] [2022-04-27 13:48:42,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:48:42,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:48:42,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:48:42,567 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:48:42,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 13:48:42,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:48:42,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:48:42,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 13:48:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:48:42,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:48:43,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {41556#true} call ULTIMATE.init(); {41556#true} is VALID [2022-04-27 13:48:43,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {41556#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41564#(<= ~counter~0 0)} is VALID [2022-04-27 13:48:43,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {41564#(<= ~counter~0 0)} assume true; {41564#(<= ~counter~0 0)} is VALID [2022-04-27 13:48:43,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41564#(<= ~counter~0 0)} {41556#true} #92#return; {41564#(<= ~counter~0 0)} is VALID [2022-04-27 13:48:43,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {41564#(<= ~counter~0 0)} call #t~ret7 := main(); {41564#(<= ~counter~0 0)} is VALID [2022-04-27 13:48:43,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {41564#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {41564#(<= ~counter~0 0)} is VALID [2022-04-27 13:48:43,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {41564#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {41580#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,556 INFO L272 TraceCheckUtils]: 8: Hoare triple {41580#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {41580#(<= ~counter~0 1)} ~cond := #in~cond; {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {41580#(<= ~counter~0 1)} assume !(0 == ~cond); {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {41580#(<= ~counter~0 1)} assume true; {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,557 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {41580#(<= ~counter~0 1)} {41580#(<= ~counter~0 1)} #78#return; {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,557 INFO L272 TraceCheckUtils]: 13: Hoare triple {41580#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {41580#(<= ~counter~0 1)} ~cond := #in~cond; {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {41580#(<= ~counter~0 1)} assume !(0 == ~cond); {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {41580#(<= ~counter~0 1)} assume true; {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,558 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {41580#(<= ~counter~0 1)} {41580#(<= ~counter~0 1)} #80#return; {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,559 INFO L272 TraceCheckUtils]: 18: Hoare triple {41580#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {41580#(<= ~counter~0 1)} ~cond := #in~cond; {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {41580#(<= ~counter~0 1)} assume !(0 == ~cond); {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {41580#(<= ~counter~0 1)} assume true; {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,560 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {41580#(<= ~counter~0 1)} {41580#(<= ~counter~0 1)} #82#return; {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {41580#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {41580#(<= ~counter~0 1)} is VALID [2022-04-27 13:48:43,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {41580#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {41635#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,561 INFO L272 TraceCheckUtils]: 26: Hoare triple {41635#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {41635#(<= ~counter~0 2)} ~cond := #in~cond; {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {41635#(<= ~counter~0 2)} assume !(0 == ~cond); {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {41635#(<= ~counter~0 2)} assume true; {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,562 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {41635#(<= ~counter~0 2)} {41635#(<= ~counter~0 2)} #78#return; {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,563 INFO L272 TraceCheckUtils]: 31: Hoare triple {41635#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {41635#(<= ~counter~0 2)} ~cond := #in~cond; {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {41635#(<= ~counter~0 2)} assume !(0 == ~cond); {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {41635#(<= ~counter~0 2)} assume true; {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,564 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {41635#(<= ~counter~0 2)} {41635#(<= ~counter~0 2)} #80#return; {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,564 INFO L272 TraceCheckUtils]: 36: Hoare triple {41635#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {41635#(<= ~counter~0 2)} ~cond := #in~cond; {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {41635#(<= ~counter~0 2)} assume !(0 == ~cond); {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {41635#(<= ~counter~0 2)} assume true; {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,565 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {41635#(<= ~counter~0 2)} {41635#(<= ~counter~0 2)} #82#return; {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,566 INFO L290 TraceCheckUtils]: 41: Hoare triple {41635#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {41635#(<= ~counter~0 2)} is VALID [2022-04-27 13:48:43,566 INFO L290 TraceCheckUtils]: 42: Hoare triple {41635#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,567 INFO L290 TraceCheckUtils]: 43: Hoare triple {41690#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,567 INFO L272 TraceCheckUtils]: 44: Hoare triple {41690#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {41690#(<= ~counter~0 3)} ~cond := #in~cond; {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,567 INFO L290 TraceCheckUtils]: 46: Hoare triple {41690#(<= ~counter~0 3)} assume !(0 == ~cond); {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,568 INFO L290 TraceCheckUtils]: 47: Hoare triple {41690#(<= ~counter~0 3)} assume true; {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,568 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {41690#(<= ~counter~0 3)} {41690#(<= ~counter~0 3)} #78#return; {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,568 INFO L272 TraceCheckUtils]: 49: Hoare triple {41690#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,569 INFO L290 TraceCheckUtils]: 50: Hoare triple {41690#(<= ~counter~0 3)} ~cond := #in~cond; {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {41690#(<= ~counter~0 3)} assume !(0 == ~cond); {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {41690#(<= ~counter~0 3)} assume true; {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,569 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {41690#(<= ~counter~0 3)} {41690#(<= ~counter~0 3)} #80#return; {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,570 INFO L272 TraceCheckUtils]: 54: Hoare triple {41690#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,570 INFO L290 TraceCheckUtils]: 55: Hoare triple {41690#(<= ~counter~0 3)} ~cond := #in~cond; {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {41690#(<= ~counter~0 3)} assume !(0 == ~cond); {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {41690#(<= ~counter~0 3)} assume true; {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,571 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {41690#(<= ~counter~0 3)} {41690#(<= ~counter~0 3)} #82#return; {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {41690#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {41690#(<= ~counter~0 3)} is VALID [2022-04-27 13:48:43,572 INFO L290 TraceCheckUtils]: 60: Hoare triple {41690#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,572 INFO L290 TraceCheckUtils]: 61: Hoare triple {41745#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,572 INFO L272 TraceCheckUtils]: 62: Hoare triple {41745#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,573 INFO L290 TraceCheckUtils]: 63: Hoare triple {41745#(<= ~counter~0 4)} ~cond := #in~cond; {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,573 INFO L290 TraceCheckUtils]: 64: Hoare triple {41745#(<= ~counter~0 4)} assume !(0 == ~cond); {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,573 INFO L290 TraceCheckUtils]: 65: Hoare triple {41745#(<= ~counter~0 4)} assume true; {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,573 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {41745#(<= ~counter~0 4)} {41745#(<= ~counter~0 4)} #78#return; {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,574 INFO L272 TraceCheckUtils]: 67: Hoare triple {41745#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {41745#(<= ~counter~0 4)} ~cond := #in~cond; {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {41745#(<= ~counter~0 4)} assume !(0 == ~cond); {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,575 INFO L290 TraceCheckUtils]: 70: Hoare triple {41745#(<= ~counter~0 4)} assume true; {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,575 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {41745#(<= ~counter~0 4)} {41745#(<= ~counter~0 4)} #80#return; {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,575 INFO L272 TraceCheckUtils]: 72: Hoare triple {41745#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,576 INFO L290 TraceCheckUtils]: 73: Hoare triple {41745#(<= ~counter~0 4)} ~cond := #in~cond; {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,576 INFO L290 TraceCheckUtils]: 74: Hoare triple {41745#(<= ~counter~0 4)} assume !(0 == ~cond); {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,576 INFO L290 TraceCheckUtils]: 75: Hoare triple {41745#(<= ~counter~0 4)} assume true; {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,577 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {41745#(<= ~counter~0 4)} {41745#(<= ~counter~0 4)} #82#return; {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,577 INFO L290 TraceCheckUtils]: 77: Hoare triple {41745#(<= ~counter~0 4)} assume !(~r~0 >= ~d~0); {41745#(<= ~counter~0 4)} is VALID [2022-04-27 13:48:43,577 INFO L290 TraceCheckUtils]: 78: Hoare triple {41745#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,578 INFO L290 TraceCheckUtils]: 79: Hoare triple {41800#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,578 INFO L272 TraceCheckUtils]: 80: Hoare triple {41800#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,578 INFO L290 TraceCheckUtils]: 81: Hoare triple {41800#(<= ~counter~0 5)} ~cond := #in~cond; {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,579 INFO L290 TraceCheckUtils]: 82: Hoare triple {41800#(<= ~counter~0 5)} assume !(0 == ~cond); {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,579 INFO L290 TraceCheckUtils]: 83: Hoare triple {41800#(<= ~counter~0 5)} assume true; {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,579 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {41800#(<= ~counter~0 5)} {41800#(<= ~counter~0 5)} #84#return; {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,580 INFO L272 TraceCheckUtils]: 85: Hoare triple {41800#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,580 INFO L290 TraceCheckUtils]: 86: Hoare triple {41800#(<= ~counter~0 5)} ~cond := #in~cond; {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,580 INFO L290 TraceCheckUtils]: 87: Hoare triple {41800#(<= ~counter~0 5)} assume !(0 == ~cond); {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,580 INFO L290 TraceCheckUtils]: 88: Hoare triple {41800#(<= ~counter~0 5)} assume true; {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,581 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {41800#(<= ~counter~0 5)} {41800#(<= ~counter~0 5)} #86#return; {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,581 INFO L290 TraceCheckUtils]: 90: Hoare triple {41800#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,581 INFO L290 TraceCheckUtils]: 91: Hoare triple {41800#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:43,582 INFO L290 TraceCheckUtils]: 92: Hoare triple {41800#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,582 INFO L290 TraceCheckUtils]: 93: Hoare triple {41843#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,583 INFO L272 TraceCheckUtils]: 94: Hoare triple {41843#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,583 INFO L290 TraceCheckUtils]: 95: Hoare triple {41843#(<= ~counter~0 6)} ~cond := #in~cond; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,583 INFO L290 TraceCheckUtils]: 96: Hoare triple {41843#(<= ~counter~0 6)} assume !(0 == ~cond); {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,583 INFO L290 TraceCheckUtils]: 97: Hoare triple {41843#(<= ~counter~0 6)} assume true; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,584 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {41843#(<= ~counter~0 6)} {41843#(<= ~counter~0 6)} #84#return; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,584 INFO L272 TraceCheckUtils]: 99: Hoare triple {41843#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,584 INFO L290 TraceCheckUtils]: 100: Hoare triple {41843#(<= ~counter~0 6)} ~cond := #in~cond; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,585 INFO L290 TraceCheckUtils]: 101: Hoare triple {41843#(<= ~counter~0 6)} assume !(0 == ~cond); {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,585 INFO L290 TraceCheckUtils]: 102: Hoare triple {41843#(<= ~counter~0 6)} assume true; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,585 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {41843#(<= ~counter~0 6)} {41843#(<= ~counter~0 6)} #86#return; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,586 INFO L290 TraceCheckUtils]: 104: Hoare triple {41843#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,586 INFO L290 TraceCheckUtils]: 105: Hoare triple {41843#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:43,586 INFO L290 TraceCheckUtils]: 106: Hoare triple {41843#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,587 INFO L290 TraceCheckUtils]: 107: Hoare triple {41886#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,587 INFO L272 TraceCheckUtils]: 108: Hoare triple {41886#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,587 INFO L290 TraceCheckUtils]: 109: Hoare triple {41886#(<= ~counter~0 7)} ~cond := #in~cond; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,588 INFO L290 TraceCheckUtils]: 110: Hoare triple {41886#(<= ~counter~0 7)} assume !(0 == ~cond); {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,588 INFO L290 TraceCheckUtils]: 111: Hoare triple {41886#(<= ~counter~0 7)} assume true; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,588 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {41886#(<= ~counter~0 7)} {41886#(<= ~counter~0 7)} #84#return; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,589 INFO L272 TraceCheckUtils]: 113: Hoare triple {41886#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,589 INFO L290 TraceCheckUtils]: 114: Hoare triple {41886#(<= ~counter~0 7)} ~cond := #in~cond; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,589 INFO L290 TraceCheckUtils]: 115: Hoare triple {41886#(<= ~counter~0 7)} assume !(0 == ~cond); {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,589 INFO L290 TraceCheckUtils]: 116: Hoare triple {41886#(<= ~counter~0 7)} assume true; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,596 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {41886#(<= ~counter~0 7)} {41886#(<= ~counter~0 7)} #86#return; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,597 INFO L290 TraceCheckUtils]: 118: Hoare triple {41886#(<= ~counter~0 7)} 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); {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,597 INFO L290 TraceCheckUtils]: 119: Hoare triple {41886#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:43,598 INFO L290 TraceCheckUtils]: 120: Hoare triple {41886#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,598 INFO L290 TraceCheckUtils]: 121: Hoare triple {41929#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,599 INFO L272 TraceCheckUtils]: 122: Hoare triple {41929#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,599 INFO L290 TraceCheckUtils]: 123: Hoare triple {41929#(<= ~counter~0 8)} ~cond := #in~cond; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,599 INFO L290 TraceCheckUtils]: 124: Hoare triple {41929#(<= ~counter~0 8)} assume !(0 == ~cond); {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,599 INFO L290 TraceCheckUtils]: 125: Hoare triple {41929#(<= ~counter~0 8)} assume true; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,600 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {41929#(<= ~counter~0 8)} {41929#(<= ~counter~0 8)} #84#return; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,600 INFO L272 TraceCheckUtils]: 127: Hoare triple {41929#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,601 INFO L290 TraceCheckUtils]: 128: Hoare triple {41929#(<= ~counter~0 8)} ~cond := #in~cond; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,601 INFO L290 TraceCheckUtils]: 129: Hoare triple {41929#(<= ~counter~0 8)} assume !(0 == ~cond); {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,601 INFO L290 TraceCheckUtils]: 130: Hoare triple {41929#(<= ~counter~0 8)} assume true; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,601 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {41929#(<= ~counter~0 8)} {41929#(<= ~counter~0 8)} #86#return; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,602 INFO L290 TraceCheckUtils]: 132: Hoare triple {41929#(<= ~counter~0 8)} 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); {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,602 INFO L290 TraceCheckUtils]: 133: Hoare triple {41929#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:43,602 INFO L290 TraceCheckUtils]: 134: Hoare triple {41929#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,603 INFO L290 TraceCheckUtils]: 135: Hoare triple {41972#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,603 INFO L272 TraceCheckUtils]: 136: Hoare triple {41972#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,603 INFO L290 TraceCheckUtils]: 137: Hoare triple {41972#(<= ~counter~0 9)} ~cond := #in~cond; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,604 INFO L290 TraceCheckUtils]: 138: Hoare triple {41972#(<= ~counter~0 9)} assume !(0 == ~cond); {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,604 INFO L290 TraceCheckUtils]: 139: Hoare triple {41972#(<= ~counter~0 9)} assume true; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,604 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {41972#(<= ~counter~0 9)} {41972#(<= ~counter~0 9)} #84#return; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,605 INFO L272 TraceCheckUtils]: 141: Hoare triple {41972#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,605 INFO L290 TraceCheckUtils]: 142: Hoare triple {41972#(<= ~counter~0 9)} ~cond := #in~cond; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,605 INFO L290 TraceCheckUtils]: 143: Hoare triple {41972#(<= ~counter~0 9)} assume !(0 == ~cond); {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,605 INFO L290 TraceCheckUtils]: 144: Hoare triple {41972#(<= ~counter~0 9)} assume true; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,606 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {41972#(<= ~counter~0 9)} {41972#(<= ~counter~0 9)} #86#return; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,606 INFO L290 TraceCheckUtils]: 146: Hoare triple {41972#(<= ~counter~0 9)} 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); {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,606 INFO L290 TraceCheckUtils]: 147: Hoare triple {41972#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:43,607 INFO L290 TraceCheckUtils]: 148: Hoare triple {41972#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,607 INFO L290 TraceCheckUtils]: 149: Hoare triple {42015#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,608 INFO L272 TraceCheckUtils]: 150: Hoare triple {42015#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,608 INFO L290 TraceCheckUtils]: 151: Hoare triple {42015#(<= ~counter~0 10)} ~cond := #in~cond; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,608 INFO L290 TraceCheckUtils]: 152: Hoare triple {42015#(<= ~counter~0 10)} assume !(0 == ~cond); {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,608 INFO L290 TraceCheckUtils]: 153: Hoare triple {42015#(<= ~counter~0 10)} assume true; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,609 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {42015#(<= ~counter~0 10)} {42015#(<= ~counter~0 10)} #84#return; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,609 INFO L272 TraceCheckUtils]: 155: Hoare triple {42015#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,609 INFO L290 TraceCheckUtils]: 156: Hoare triple {42015#(<= ~counter~0 10)} ~cond := #in~cond; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,610 INFO L290 TraceCheckUtils]: 157: Hoare triple {42015#(<= ~counter~0 10)} assume !(0 == ~cond); {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,610 INFO L290 TraceCheckUtils]: 158: Hoare triple {42015#(<= ~counter~0 10)} assume true; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,610 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {42015#(<= ~counter~0 10)} {42015#(<= ~counter~0 10)} #86#return; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,611 INFO L290 TraceCheckUtils]: 160: Hoare triple {42015#(<= ~counter~0 10)} 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); {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,611 INFO L290 TraceCheckUtils]: 161: Hoare triple {42015#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:43,611 INFO L290 TraceCheckUtils]: 162: Hoare triple {42015#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,612 INFO L290 TraceCheckUtils]: 163: Hoare triple {42058#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,612 INFO L272 TraceCheckUtils]: 164: Hoare triple {42058#(<= ~counter~0 11)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,612 INFO L290 TraceCheckUtils]: 165: Hoare triple {42058#(<= ~counter~0 11)} ~cond := #in~cond; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,613 INFO L290 TraceCheckUtils]: 166: Hoare triple {42058#(<= ~counter~0 11)} assume !(0 == ~cond); {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,613 INFO L290 TraceCheckUtils]: 167: Hoare triple {42058#(<= ~counter~0 11)} assume true; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,613 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {42058#(<= ~counter~0 11)} {42058#(<= ~counter~0 11)} #84#return; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,614 INFO L272 TraceCheckUtils]: 169: Hoare triple {42058#(<= ~counter~0 11)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,614 INFO L290 TraceCheckUtils]: 170: Hoare triple {42058#(<= ~counter~0 11)} ~cond := #in~cond; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,614 INFO L290 TraceCheckUtils]: 171: Hoare triple {42058#(<= ~counter~0 11)} assume !(0 == ~cond); {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,614 INFO L290 TraceCheckUtils]: 172: Hoare triple {42058#(<= ~counter~0 11)} assume true; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,615 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {42058#(<= ~counter~0 11)} {42058#(<= ~counter~0 11)} #86#return; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,615 INFO L290 TraceCheckUtils]: 174: Hoare triple {42058#(<= ~counter~0 11)} 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); {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,615 INFO L290 TraceCheckUtils]: 175: Hoare triple {42058#(<= ~counter~0 11)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:43,616 INFO L290 TraceCheckUtils]: 176: Hoare triple {42058#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,616 INFO L290 TraceCheckUtils]: 177: Hoare triple {42101#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,617 INFO L272 TraceCheckUtils]: 178: Hoare triple {42101#(<= ~counter~0 12)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,617 INFO L290 TraceCheckUtils]: 179: Hoare triple {42101#(<= ~counter~0 12)} ~cond := #in~cond; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,617 INFO L290 TraceCheckUtils]: 180: Hoare triple {42101#(<= ~counter~0 12)} assume !(0 == ~cond); {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,617 INFO L290 TraceCheckUtils]: 181: Hoare triple {42101#(<= ~counter~0 12)} assume true; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,618 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {42101#(<= ~counter~0 12)} {42101#(<= ~counter~0 12)} #84#return; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,618 INFO L272 TraceCheckUtils]: 183: Hoare triple {42101#(<= ~counter~0 12)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,618 INFO L290 TraceCheckUtils]: 184: Hoare triple {42101#(<= ~counter~0 12)} ~cond := #in~cond; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,619 INFO L290 TraceCheckUtils]: 185: Hoare triple {42101#(<= ~counter~0 12)} assume !(0 == ~cond); {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,619 INFO L290 TraceCheckUtils]: 186: Hoare triple {42101#(<= ~counter~0 12)} assume true; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,619 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {42101#(<= ~counter~0 12)} {42101#(<= ~counter~0 12)} #86#return; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,619 INFO L290 TraceCheckUtils]: 188: Hoare triple {42101#(<= ~counter~0 12)} 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); {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,620 INFO L290 TraceCheckUtils]: 189: Hoare triple {42101#(<= ~counter~0 12)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:43,620 INFO L290 TraceCheckUtils]: 190: Hoare triple {42101#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,620 INFO L290 TraceCheckUtils]: 191: Hoare triple {42144#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,621 INFO L272 TraceCheckUtils]: 192: Hoare triple {42144#(<= ~counter~0 13)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,621 INFO L290 TraceCheckUtils]: 193: Hoare triple {42144#(<= ~counter~0 13)} ~cond := #in~cond; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,621 INFO L290 TraceCheckUtils]: 194: Hoare triple {42144#(<= ~counter~0 13)} assume !(0 == ~cond); {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,622 INFO L290 TraceCheckUtils]: 195: Hoare triple {42144#(<= ~counter~0 13)} assume true; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,622 INFO L284 TraceCheckUtils]: 196: Hoare quadruple {42144#(<= ~counter~0 13)} {42144#(<= ~counter~0 13)} #84#return; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,623 INFO L272 TraceCheckUtils]: 197: Hoare triple {42144#(<= ~counter~0 13)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,623 INFO L290 TraceCheckUtils]: 198: Hoare triple {42144#(<= ~counter~0 13)} ~cond := #in~cond; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,623 INFO L290 TraceCheckUtils]: 199: Hoare triple {42144#(<= ~counter~0 13)} assume !(0 == ~cond); {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,623 INFO L290 TraceCheckUtils]: 200: Hoare triple {42144#(<= ~counter~0 13)} assume true; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,624 INFO L284 TraceCheckUtils]: 201: Hoare quadruple {42144#(<= ~counter~0 13)} {42144#(<= ~counter~0 13)} #86#return; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,624 INFO L290 TraceCheckUtils]: 202: Hoare triple {42144#(<= ~counter~0 13)} 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); {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,624 INFO L290 TraceCheckUtils]: 203: Hoare triple {42144#(<= ~counter~0 13)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:43,625 INFO L290 TraceCheckUtils]: 204: Hoare triple {42144#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,625 INFO L290 TraceCheckUtils]: 205: Hoare triple {42187#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,625 INFO L272 TraceCheckUtils]: 206: Hoare triple {42187#(<= ~counter~0 14)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,626 INFO L290 TraceCheckUtils]: 207: Hoare triple {42187#(<= ~counter~0 14)} ~cond := #in~cond; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,626 INFO L290 TraceCheckUtils]: 208: Hoare triple {42187#(<= ~counter~0 14)} assume !(0 == ~cond); {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,626 INFO L290 TraceCheckUtils]: 209: Hoare triple {42187#(<= ~counter~0 14)} assume true; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,627 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {42187#(<= ~counter~0 14)} {42187#(<= ~counter~0 14)} #84#return; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,627 INFO L272 TraceCheckUtils]: 211: Hoare triple {42187#(<= ~counter~0 14)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,627 INFO L290 TraceCheckUtils]: 212: Hoare triple {42187#(<= ~counter~0 14)} ~cond := #in~cond; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,628 INFO L290 TraceCheckUtils]: 213: Hoare triple {42187#(<= ~counter~0 14)} assume !(0 == ~cond); {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,628 INFO L290 TraceCheckUtils]: 214: Hoare triple {42187#(<= ~counter~0 14)} assume true; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,628 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {42187#(<= ~counter~0 14)} {42187#(<= ~counter~0 14)} #86#return; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,628 INFO L290 TraceCheckUtils]: 216: Hoare triple {42187#(<= ~counter~0 14)} 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); {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,629 INFO L290 TraceCheckUtils]: 217: Hoare triple {42187#(<= ~counter~0 14)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:43,629 INFO L290 TraceCheckUtils]: 218: Hoare triple {42187#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42230#(<= |main_#t~post6| 14)} is VALID [2022-04-27 13:48:43,629 INFO L290 TraceCheckUtils]: 219: Hoare triple {42230#(<= |main_#t~post6| 14)} assume !(#t~post6 < 20);havoc #t~post6; {41557#false} is VALID [2022-04-27 13:48:43,629 INFO L272 TraceCheckUtils]: 220: Hoare triple {41557#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {41557#false} is VALID [2022-04-27 13:48:43,630 INFO L290 TraceCheckUtils]: 221: Hoare triple {41557#false} ~cond := #in~cond; {41557#false} is VALID [2022-04-27 13:48:43,630 INFO L290 TraceCheckUtils]: 222: Hoare triple {41557#false} assume 0 == ~cond; {41557#false} is VALID [2022-04-27 13:48:43,630 INFO L290 TraceCheckUtils]: 223: Hoare triple {41557#false} assume !false; {41557#false} is VALID [2022-04-27 13:48:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2374 backedges. 64 proven. 2222 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-27 13:48:43,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:48:44,441 INFO L290 TraceCheckUtils]: 223: Hoare triple {41557#false} assume !false; {41557#false} is VALID [2022-04-27 13:48:44,441 INFO L290 TraceCheckUtils]: 222: Hoare triple {41557#false} assume 0 == ~cond; {41557#false} is VALID [2022-04-27 13:48:44,441 INFO L290 TraceCheckUtils]: 221: Hoare triple {41557#false} ~cond := #in~cond; {41557#false} is VALID [2022-04-27 13:48:44,441 INFO L272 TraceCheckUtils]: 220: Hoare triple {41557#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {41557#false} is VALID [2022-04-27 13:48:44,442 INFO L290 TraceCheckUtils]: 219: Hoare triple {42258#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {41557#false} is VALID [2022-04-27 13:48:44,442 INFO L290 TraceCheckUtils]: 218: Hoare triple {42262#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42258#(< |main_#t~post6| 20)} is VALID [2022-04-27 13:48:44,442 INFO L290 TraceCheckUtils]: 217: Hoare triple {42262#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42262#(< ~counter~0 20)} is VALID [2022-04-27 13:48:44,442 INFO L290 TraceCheckUtils]: 216: Hoare triple {42262#(< ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42262#(< ~counter~0 20)} is VALID [2022-04-27 13:48:44,443 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {41556#true} {42262#(< ~counter~0 20)} #86#return; {42262#(< ~counter~0 20)} is VALID [2022-04-27 13:48:44,443 INFO L290 TraceCheckUtils]: 214: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,443 INFO L290 TraceCheckUtils]: 213: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,443 INFO L290 TraceCheckUtils]: 212: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,443 INFO L272 TraceCheckUtils]: 211: Hoare triple {42262#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,444 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {41556#true} {42262#(< ~counter~0 20)} #84#return; {42262#(< ~counter~0 20)} is VALID [2022-04-27 13:48:44,444 INFO L290 TraceCheckUtils]: 209: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,444 INFO L290 TraceCheckUtils]: 208: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,444 INFO L290 TraceCheckUtils]: 207: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,444 INFO L272 TraceCheckUtils]: 206: Hoare triple {42262#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,444 INFO L290 TraceCheckUtils]: 205: Hoare triple {42262#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {42262#(< ~counter~0 20)} is VALID [2022-04-27 13:48:44,445 INFO L290 TraceCheckUtils]: 204: Hoare triple {42305#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42262#(< ~counter~0 20)} is VALID [2022-04-27 13:48:44,445 INFO L290 TraceCheckUtils]: 203: Hoare triple {42305#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42305#(< ~counter~0 19)} is VALID [2022-04-27 13:48:44,445 INFO L290 TraceCheckUtils]: 202: Hoare triple {42305#(< ~counter~0 19)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42305#(< ~counter~0 19)} is VALID [2022-04-27 13:48:44,446 INFO L284 TraceCheckUtils]: 201: Hoare quadruple {41556#true} {42305#(< ~counter~0 19)} #86#return; {42305#(< ~counter~0 19)} is VALID [2022-04-27 13:48:44,446 INFO L290 TraceCheckUtils]: 200: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,446 INFO L290 TraceCheckUtils]: 199: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,446 INFO L290 TraceCheckUtils]: 198: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,446 INFO L272 TraceCheckUtils]: 197: Hoare triple {42305#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,447 INFO L284 TraceCheckUtils]: 196: Hoare quadruple {41556#true} {42305#(< ~counter~0 19)} #84#return; {42305#(< ~counter~0 19)} is VALID [2022-04-27 13:48:44,447 INFO L290 TraceCheckUtils]: 195: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,447 INFO L290 TraceCheckUtils]: 194: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,447 INFO L290 TraceCheckUtils]: 193: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,447 INFO L272 TraceCheckUtils]: 192: Hoare triple {42305#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,447 INFO L290 TraceCheckUtils]: 191: Hoare triple {42305#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {42305#(< ~counter~0 19)} is VALID [2022-04-27 13:48:44,448 INFO L290 TraceCheckUtils]: 190: Hoare triple {42348#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42305#(< ~counter~0 19)} is VALID [2022-04-27 13:48:44,448 INFO L290 TraceCheckUtils]: 189: Hoare triple {42348#(< ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42348#(< ~counter~0 18)} is VALID [2022-04-27 13:48:44,448 INFO L290 TraceCheckUtils]: 188: Hoare triple {42348#(< ~counter~0 18)} 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); {42348#(< ~counter~0 18)} is VALID [2022-04-27 13:48:44,448 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {41556#true} {42348#(< ~counter~0 18)} #86#return; {42348#(< ~counter~0 18)} is VALID [2022-04-27 13:48:44,449 INFO L290 TraceCheckUtils]: 186: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,449 INFO L290 TraceCheckUtils]: 185: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,449 INFO L290 TraceCheckUtils]: 184: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,449 INFO L272 TraceCheckUtils]: 183: Hoare triple {42348#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,449 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {41556#true} {42348#(< ~counter~0 18)} #84#return; {42348#(< ~counter~0 18)} is VALID [2022-04-27 13:48:44,449 INFO L290 TraceCheckUtils]: 181: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,449 INFO L290 TraceCheckUtils]: 180: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,449 INFO L290 TraceCheckUtils]: 179: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,449 INFO L272 TraceCheckUtils]: 178: Hoare triple {42348#(< ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,450 INFO L290 TraceCheckUtils]: 177: Hoare triple {42348#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {42348#(< ~counter~0 18)} is VALID [2022-04-27 13:48:44,450 INFO L290 TraceCheckUtils]: 176: Hoare triple {42391#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42348#(< ~counter~0 18)} is VALID [2022-04-27 13:48:44,450 INFO L290 TraceCheckUtils]: 175: Hoare triple {42391#(< ~counter~0 17)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42391#(< ~counter~0 17)} is VALID [2022-04-27 13:48:44,451 INFO L290 TraceCheckUtils]: 174: Hoare triple {42391#(< ~counter~0 17)} 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); {42391#(< ~counter~0 17)} is VALID [2022-04-27 13:48:44,451 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {41556#true} {42391#(< ~counter~0 17)} #86#return; {42391#(< ~counter~0 17)} is VALID [2022-04-27 13:48:44,451 INFO L290 TraceCheckUtils]: 172: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,451 INFO L290 TraceCheckUtils]: 171: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,451 INFO L290 TraceCheckUtils]: 170: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,451 INFO L272 TraceCheckUtils]: 169: Hoare triple {42391#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,452 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {41556#true} {42391#(< ~counter~0 17)} #84#return; {42391#(< ~counter~0 17)} is VALID [2022-04-27 13:48:44,452 INFO L290 TraceCheckUtils]: 167: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,452 INFO L290 TraceCheckUtils]: 166: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,452 INFO L290 TraceCheckUtils]: 165: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,452 INFO L272 TraceCheckUtils]: 164: Hoare triple {42391#(< ~counter~0 17)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,452 INFO L290 TraceCheckUtils]: 163: Hoare triple {42391#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {42391#(< ~counter~0 17)} is VALID [2022-04-27 13:48:44,453 INFO L290 TraceCheckUtils]: 162: Hoare triple {42434#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42391#(< ~counter~0 17)} is VALID [2022-04-27 13:48:44,471 INFO L290 TraceCheckUtils]: 161: Hoare triple {42434#(< ~counter~0 16)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42434#(< ~counter~0 16)} is VALID [2022-04-27 13:48:44,471 INFO L290 TraceCheckUtils]: 160: Hoare triple {42434#(< ~counter~0 16)} 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); {42434#(< ~counter~0 16)} is VALID [2022-04-27 13:48:44,472 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {41556#true} {42434#(< ~counter~0 16)} #86#return; {42434#(< ~counter~0 16)} is VALID [2022-04-27 13:48:44,472 INFO L290 TraceCheckUtils]: 158: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,472 INFO L290 TraceCheckUtils]: 157: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,472 INFO L290 TraceCheckUtils]: 156: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,472 INFO L272 TraceCheckUtils]: 155: Hoare triple {42434#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,473 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {41556#true} {42434#(< ~counter~0 16)} #84#return; {42434#(< ~counter~0 16)} is VALID [2022-04-27 13:48:44,473 INFO L290 TraceCheckUtils]: 153: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,473 INFO L290 TraceCheckUtils]: 152: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,473 INFO L290 TraceCheckUtils]: 151: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,473 INFO L272 TraceCheckUtils]: 150: Hoare triple {42434#(< ~counter~0 16)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,473 INFO L290 TraceCheckUtils]: 149: Hoare triple {42434#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {42434#(< ~counter~0 16)} is VALID [2022-04-27 13:48:44,474 INFO L290 TraceCheckUtils]: 148: Hoare triple {42187#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42434#(< ~counter~0 16)} is VALID [2022-04-27 13:48:44,475 INFO L290 TraceCheckUtils]: 147: Hoare triple {42187#(<= ~counter~0 14)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:44,475 INFO L290 TraceCheckUtils]: 146: Hoare triple {42187#(<= ~counter~0 14)} 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); {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:44,475 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {41556#true} {42187#(<= ~counter~0 14)} #86#return; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:44,475 INFO L290 TraceCheckUtils]: 144: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,475 INFO L290 TraceCheckUtils]: 143: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,476 INFO L290 TraceCheckUtils]: 142: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,476 INFO L272 TraceCheckUtils]: 141: Hoare triple {42187#(<= ~counter~0 14)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,476 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {41556#true} {42187#(<= ~counter~0 14)} #84#return; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:44,476 INFO L290 TraceCheckUtils]: 139: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,476 INFO L290 TraceCheckUtils]: 138: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,476 INFO L290 TraceCheckUtils]: 137: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,476 INFO L272 TraceCheckUtils]: 136: Hoare triple {42187#(<= ~counter~0 14)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,477 INFO L290 TraceCheckUtils]: 135: Hoare triple {42187#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:44,477 INFO L290 TraceCheckUtils]: 134: Hoare triple {42144#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42187#(<= ~counter~0 14)} is VALID [2022-04-27 13:48:44,477 INFO L290 TraceCheckUtils]: 133: Hoare triple {42144#(<= ~counter~0 13)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:44,478 INFO L290 TraceCheckUtils]: 132: Hoare triple {42144#(<= ~counter~0 13)} 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); {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:44,478 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {41556#true} {42144#(<= ~counter~0 13)} #86#return; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:44,478 INFO L290 TraceCheckUtils]: 130: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,478 INFO L290 TraceCheckUtils]: 129: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,478 INFO L290 TraceCheckUtils]: 128: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,478 INFO L272 TraceCheckUtils]: 127: Hoare triple {42144#(<= ~counter~0 13)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,479 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {41556#true} {42144#(<= ~counter~0 13)} #84#return; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:44,479 INFO L290 TraceCheckUtils]: 125: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,479 INFO L290 TraceCheckUtils]: 124: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,479 INFO L290 TraceCheckUtils]: 123: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,479 INFO L272 TraceCheckUtils]: 122: Hoare triple {42144#(<= ~counter~0 13)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,479 INFO L290 TraceCheckUtils]: 121: Hoare triple {42144#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:44,480 INFO L290 TraceCheckUtils]: 120: Hoare triple {42101#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42144#(<= ~counter~0 13)} is VALID [2022-04-27 13:48:44,480 INFO L290 TraceCheckUtils]: 119: Hoare triple {42101#(<= ~counter~0 12)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:44,480 INFO L290 TraceCheckUtils]: 118: Hoare triple {42101#(<= ~counter~0 12)} 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); {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:44,481 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {41556#true} {42101#(<= ~counter~0 12)} #86#return; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:44,481 INFO L290 TraceCheckUtils]: 116: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,481 INFO L290 TraceCheckUtils]: 115: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,481 INFO L290 TraceCheckUtils]: 114: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,481 INFO L272 TraceCheckUtils]: 113: Hoare triple {42101#(<= ~counter~0 12)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,481 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {41556#true} {42101#(<= ~counter~0 12)} #84#return; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:44,481 INFO L290 TraceCheckUtils]: 111: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,481 INFO L290 TraceCheckUtils]: 110: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,482 INFO L290 TraceCheckUtils]: 109: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,482 INFO L272 TraceCheckUtils]: 108: Hoare triple {42101#(<= ~counter~0 12)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,482 INFO L290 TraceCheckUtils]: 107: Hoare triple {42101#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:44,482 INFO L290 TraceCheckUtils]: 106: Hoare triple {42058#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42101#(<= ~counter~0 12)} is VALID [2022-04-27 13:48:44,483 INFO L290 TraceCheckUtils]: 105: Hoare triple {42058#(<= ~counter~0 11)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:44,483 INFO L290 TraceCheckUtils]: 104: Hoare triple {42058#(<= ~counter~0 11)} 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); {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:44,483 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {41556#true} {42058#(<= ~counter~0 11)} #86#return; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:44,483 INFO L290 TraceCheckUtils]: 102: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,483 INFO L290 TraceCheckUtils]: 101: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,483 INFO L290 TraceCheckUtils]: 100: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,484 INFO L272 TraceCheckUtils]: 99: Hoare triple {42058#(<= ~counter~0 11)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,484 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {41556#true} {42058#(<= ~counter~0 11)} #84#return; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:44,484 INFO L290 TraceCheckUtils]: 97: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,484 INFO L290 TraceCheckUtils]: 96: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,484 INFO L290 TraceCheckUtils]: 95: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,484 INFO L272 TraceCheckUtils]: 94: Hoare triple {42058#(<= ~counter~0 11)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,484 INFO L290 TraceCheckUtils]: 93: Hoare triple {42058#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:44,485 INFO L290 TraceCheckUtils]: 92: Hoare triple {42015#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42058#(<= ~counter~0 11)} is VALID [2022-04-27 13:48:44,485 INFO L290 TraceCheckUtils]: 91: Hoare triple {42015#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:44,485 INFO L290 TraceCheckUtils]: 90: Hoare triple {42015#(<= ~counter~0 10)} 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); {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:44,486 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {41556#true} {42015#(<= ~counter~0 10)} #86#return; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:44,486 INFO L290 TraceCheckUtils]: 88: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,486 INFO L290 TraceCheckUtils]: 87: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,486 INFO L290 TraceCheckUtils]: 86: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,486 INFO L272 TraceCheckUtils]: 85: Hoare triple {42015#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,487 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {41556#true} {42015#(<= ~counter~0 10)} #84#return; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:44,487 INFO L290 TraceCheckUtils]: 83: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,487 INFO L290 TraceCheckUtils]: 82: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,487 INFO L290 TraceCheckUtils]: 81: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,487 INFO L272 TraceCheckUtils]: 80: Hoare triple {42015#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,487 INFO L290 TraceCheckUtils]: 79: Hoare triple {42015#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:44,488 INFO L290 TraceCheckUtils]: 78: Hoare triple {41972#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42015#(<= ~counter~0 10)} is VALID [2022-04-27 13:48:44,488 INFO L290 TraceCheckUtils]: 77: Hoare triple {41972#(<= ~counter~0 9)} assume !(~r~0 >= ~d~0); {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:44,488 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {41556#true} {41972#(<= ~counter~0 9)} #82#return; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:44,488 INFO L290 TraceCheckUtils]: 75: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,488 INFO L290 TraceCheckUtils]: 74: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,488 INFO L290 TraceCheckUtils]: 73: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,489 INFO L272 TraceCheckUtils]: 72: Hoare triple {41972#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,489 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {41556#true} {41972#(<= ~counter~0 9)} #80#return; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:44,489 INFO L290 TraceCheckUtils]: 70: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,489 INFO L290 TraceCheckUtils]: 69: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,489 INFO L290 TraceCheckUtils]: 68: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,489 INFO L272 TraceCheckUtils]: 67: Hoare triple {41972#(<= ~counter~0 9)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,489 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {41556#true} {41972#(<= ~counter~0 9)} #78#return; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:44,490 INFO L290 TraceCheckUtils]: 65: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,490 INFO L290 TraceCheckUtils]: 64: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,490 INFO L290 TraceCheckUtils]: 63: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,490 INFO L272 TraceCheckUtils]: 62: Hoare triple {41972#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,490 INFO L290 TraceCheckUtils]: 61: Hoare triple {41972#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:44,490 INFO L290 TraceCheckUtils]: 60: Hoare triple {41929#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {41972#(<= ~counter~0 9)} is VALID [2022-04-27 13:48:44,491 INFO L290 TraceCheckUtils]: 59: Hoare triple {41929#(<= ~counter~0 8)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:44,491 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {41556#true} {41929#(<= ~counter~0 8)} #82#return; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:44,491 INFO L290 TraceCheckUtils]: 57: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,491 INFO L290 TraceCheckUtils]: 56: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,491 INFO L272 TraceCheckUtils]: 54: Hoare triple {41929#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,492 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {41556#true} {41929#(<= ~counter~0 8)} #80#return; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:44,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,492 INFO L272 TraceCheckUtils]: 49: Hoare triple {41929#(<= ~counter~0 8)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,492 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {41556#true} {41929#(<= ~counter~0 8)} #78#return; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:44,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,493 INFO L272 TraceCheckUtils]: 44: Hoare triple {41929#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,493 INFO L290 TraceCheckUtils]: 43: Hoare triple {41929#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:44,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {41886#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {41929#(<= ~counter~0 8)} is VALID [2022-04-27 13:48:44,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {41886#(<= ~counter~0 7)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:44,494 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {41556#true} {41886#(<= ~counter~0 7)} #82#return; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:44,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,494 INFO L272 TraceCheckUtils]: 36: Hoare triple {41886#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,495 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {41556#true} {41886#(<= ~counter~0 7)} #80#return; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:44,495 INFO L290 TraceCheckUtils]: 34: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,495 INFO L272 TraceCheckUtils]: 31: Hoare triple {41886#(<= ~counter~0 7)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,495 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {41556#true} {41886#(<= ~counter~0 7)} #78#return; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:44,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,495 INFO L272 TraceCheckUtils]: 26: Hoare triple {41886#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {41886#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:44,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {41843#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {41886#(<= ~counter~0 7)} is VALID [2022-04-27 13:48:44,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {41843#(<= ~counter~0 6)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:44,497 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {41556#true} {41843#(<= ~counter~0 6)} #82#return; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:44,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,497 INFO L272 TraceCheckUtils]: 18: Hoare triple {41843#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,497 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {41556#true} {41843#(<= ~counter~0 6)} #80#return; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:44,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,498 INFO L272 TraceCheckUtils]: 13: Hoare triple {41843#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,498 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {41556#true} {41843#(<= ~counter~0 6)} #78#return; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:44,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-27 13:48:44,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-27 13:48:44,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-27 13:48:44,498 INFO L272 TraceCheckUtils]: 8: Hoare triple {41843#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41556#true} is VALID [2022-04-27 13:48:44,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {41843#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:44,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {41800#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {41843#(<= ~counter~0 6)} is VALID [2022-04-27 13:48:44,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {41800#(<= ~counter~0 5)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:44,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {41800#(<= ~counter~0 5)} call #t~ret7 := main(); {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:44,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41800#(<= ~counter~0 5)} {41556#true} #92#return; {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:44,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {41800#(<= ~counter~0 5)} assume true; {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:44,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {41556#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41800#(<= ~counter~0 5)} is VALID [2022-04-27 13:48:44,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {41556#true} call ULTIMATE.init(); {41556#true} is VALID [2022-04-27 13:48:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2374 backedges. 64 proven. 326 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2022-04-27 13:48:44,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:48:44,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719314688] [2022-04-27 13:48:44,504 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:48:44,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21168090] [2022-04-27 13:48:44,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21168090] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:48:44,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:48:44,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-27 13:48:44,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645227067] [2022-04-27 13:48:44,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:48:44,505 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 22 states have call successors, (68), 17 states have call predecessors, (68), 16 states have return successors, (66), 20 states have call predecessors, (66), 20 states have call successors, (66) Word has length 224 [2022-04-27 13:48:44,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:48:44,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 22 states have call successors, (68), 17 states have call predecessors, (68), 16 states have return successors, (66), 20 states have call predecessors, (66), 20 states have call successors, (66) [2022-04-27 13:48:44,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:48:44,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 13:48:44,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:48:44,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 13:48:44,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-27 13:48:44,780 INFO L87 Difference]: Start difference. First operand 539 states and 604 transitions. Second operand has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 22 states have call successors, (68), 17 states have call predecessors, (68), 16 states have return successors, (66), 20 states have call predecessors, (66), 20 states have call successors, (66) [2022-04-27 13:48:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:48:47,563 INFO L93 Difference]: Finished difference Result 829 states and 954 transitions. [2022-04-27 13:48:47,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-27 13:48:47,563 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 22 states have call successors, (68), 17 states have call predecessors, (68), 16 states have return successors, (66), 20 states have call predecessors, (66), 20 states have call successors, (66) Word has length 224 [2022-04-27 13:48:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:48:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 22 states have call successors, (68), 17 states have call predecessors, (68), 16 states have return successors, (66), 20 states have call predecessors, (66), 20 states have call successors, (66) [2022-04-27 13:48:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 440 transitions. [2022-04-27 13:48:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 22 states have call successors, (68), 17 states have call predecessors, (68), 16 states have return successors, (66), 20 states have call predecessors, (66), 20 states have call successors, (66) [2022-04-27 13:48:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 440 transitions. [2022-04-27 13:48:47,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 440 transitions. [2022-04-27 13:48:47,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:48:47,960 INFO L225 Difference]: With dead ends: 829 [2022-04-27 13:48:47,960 INFO L226 Difference]: Without dead ends: 816 [2022-04-27 13:48:47,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 424 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=517, Invalid=965, Unknown=0, NotChecked=0, Total=1482 [2022-04-27 13:48:47,962 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 548 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 13:48:47,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 463 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 13:48:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2022-04-27 13:48:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 815. [2022-04-27 13:48:48,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:48:48,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 816 states. Second operand has 815 states, 548 states have (on average 1.1131386861313868) internal successors, (610), 565 states have internal predecessors, (610), 157 states have call successors, (157), 110 states have call predecessors, (157), 109 states have return successors, (155), 139 states have call predecessors, (155), 155 states have call successors, (155) [2022-04-27 13:48:48,677 INFO L74 IsIncluded]: Start isIncluded. First operand 816 states. Second operand has 815 states, 548 states have (on average 1.1131386861313868) internal successors, (610), 565 states have internal predecessors, (610), 157 states have call successors, (157), 110 states have call predecessors, (157), 109 states have return successors, (155), 139 states have call predecessors, (155), 155 states have call successors, (155) [2022-04-27 13:48:48,678 INFO L87 Difference]: Start difference. First operand 816 states. Second operand has 815 states, 548 states have (on average 1.1131386861313868) internal successors, (610), 565 states have internal predecessors, (610), 157 states have call successors, (157), 110 states have call predecessors, (157), 109 states have return successors, (155), 139 states have call predecessors, (155), 155 states have call successors, (155) [2022-04-27 13:48:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:48:48,699 INFO L93 Difference]: Finished difference Result 816 states and 923 transitions. [2022-04-27 13:48:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 923 transitions. [2022-04-27 13:48:48,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:48:48,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:48:48,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 815 states, 548 states have (on average 1.1131386861313868) internal successors, (610), 565 states have internal predecessors, (610), 157 states have call successors, (157), 110 states have call predecessors, (157), 109 states have return successors, (155), 139 states have call predecessors, (155), 155 states have call successors, (155) Second operand 816 states. [2022-04-27 13:48:48,702 INFO L87 Difference]: Start difference. First operand has 815 states, 548 states have (on average 1.1131386861313868) internal successors, (610), 565 states have internal predecessors, (610), 157 states have call successors, (157), 110 states have call predecessors, (157), 109 states have return successors, (155), 139 states have call predecessors, (155), 155 states have call successors, (155) Second operand 816 states. [2022-04-27 13:48:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:48:48,723 INFO L93 Difference]: Finished difference Result 816 states and 923 transitions. [2022-04-27 13:48:48,723 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 923 transitions. [2022-04-27 13:48:48,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:48:48,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:48:48,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:48:48,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:48:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 548 states have (on average 1.1131386861313868) internal successors, (610), 565 states have internal predecessors, (610), 157 states have call successors, (157), 110 states have call predecessors, (157), 109 states have return successors, (155), 139 states have call predecessors, (155), 155 states have call successors, (155) [2022-04-27 13:48:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 922 transitions. [2022-04-27 13:48:48,751 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 922 transitions. Word has length 224 [2022-04-27 13:48:48,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:48:48,751 INFO L495 AbstractCegarLoop]: Abstraction has 815 states and 922 transitions. [2022-04-27 13:48:48,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 22 states have call successors, (68), 17 states have call predecessors, (68), 16 states have return successors, (66), 20 states have call predecessors, (66), 20 states have call successors, (66) [2022-04-27 13:48:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 922 transitions. [2022-04-27 13:48:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-04-27 13:48:48,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:48:48,756 INFO L195 NwaCegarLoop]: trace histogram [45, 44, 44, 17, 16, 16, 16, 16, 16, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:48:48,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 13:48:48,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:48:48,964 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:48:48,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:48:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1873636372, now seen corresponding path program 3 times [2022-04-27 13:48:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:48:48,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358461963] [2022-04-27 13:48:48,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:48:48,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:48:48,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:48:48,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702992420] [2022-04-27 13:48:48,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:48:48,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:48:48,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:48:48,992 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:48:48,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-27 13:48:49,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2022-04-27 13:48:49,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:48:49,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 13:48:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:48:49,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:48:49,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {46809#true} call ULTIMATE.init(); {46809#true} is VALID [2022-04-27 13:48:49,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {46809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {46809#true} is VALID [2022-04-27 13:48:49,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46809#true} {46809#true} #92#return; {46809#true} is VALID [2022-04-27 13:48:49,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {46809#true} call #t~ret7 := main(); {46809#true} is VALID [2022-04-27 13:48:49,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {46809#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:49,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {46829#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:49,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {46829#(= main_~p~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:49,927 INFO L272 TraceCheckUtils]: 8: Hoare triple {46829#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,928 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #78#return; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:49,928 INFO L272 TraceCheckUtils]: 13: Hoare triple {46829#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,929 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #80#return; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:49,929 INFO L272 TraceCheckUtils]: 18: Hoare triple {46829#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,930 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #82#return; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:49,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {46829#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {46884#(= main_~p~0 2)} is VALID [2022-04-27 13:48:49,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {46884#(= main_~p~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {46884#(= main_~p~0 2)} is VALID [2022-04-27 13:48:49,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {46884#(= main_~p~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {46884#(= main_~p~0 2)} is VALID [2022-04-27 13:48:49,931 INFO L272 TraceCheckUtils]: 26: Hoare triple {46884#(= main_~p~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,931 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {46809#true} {46884#(= main_~p~0 2)} #78#return; {46884#(= main_~p~0 2)} is VALID [2022-04-27 13:48:49,931 INFO L272 TraceCheckUtils]: 31: Hoare triple {46884#(= main_~p~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,932 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {46809#true} {46884#(= main_~p~0 2)} #80#return; {46884#(= main_~p~0 2)} is VALID [2022-04-27 13:48:49,932 INFO L272 TraceCheckUtils]: 36: Hoare triple {46884#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,933 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {46809#true} {46884#(= main_~p~0 2)} #82#return; {46884#(= main_~p~0 2)} is VALID [2022-04-27 13:48:49,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {46884#(= main_~p~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {46939#(= main_~p~0 4)} is VALID [2022-04-27 13:48:49,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {46939#(= main_~p~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {46939#(= main_~p~0 4)} is VALID [2022-04-27 13:48:49,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {46939#(= main_~p~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {46939#(= main_~p~0 4)} is VALID [2022-04-27 13:48:49,934 INFO L272 TraceCheckUtils]: 44: Hoare triple {46939#(= main_~p~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,934 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {46809#true} {46939#(= main_~p~0 4)} #78#return; {46939#(= main_~p~0 4)} is VALID [2022-04-27 13:48:49,934 INFO L272 TraceCheckUtils]: 49: Hoare triple {46939#(= main_~p~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,934 INFO L290 TraceCheckUtils]: 52: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,935 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {46809#true} {46939#(= main_~p~0 4)} #80#return; {46939#(= main_~p~0 4)} is VALID [2022-04-27 13:48:49,935 INFO L272 TraceCheckUtils]: 54: Hoare triple {46939#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,935 INFO L290 TraceCheckUtils]: 55: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,935 INFO L290 TraceCheckUtils]: 56: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,935 INFO L290 TraceCheckUtils]: 57: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,935 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {46809#true} {46939#(= main_~p~0 4)} #82#return; {46939#(= main_~p~0 4)} is VALID [2022-04-27 13:48:49,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {46939#(= main_~p~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {46994#(= main_~p~0 8)} is VALID [2022-04-27 13:48:49,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {46994#(= main_~p~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {46994#(= main_~p~0 8)} is VALID [2022-04-27 13:48:49,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {46994#(= main_~p~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {46994#(= main_~p~0 8)} is VALID [2022-04-27 13:48:49,936 INFO L272 TraceCheckUtils]: 62: Hoare triple {46994#(= main_~p~0 8)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,936 INFO L290 TraceCheckUtils]: 63: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,936 INFO L290 TraceCheckUtils]: 64: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,936 INFO L290 TraceCheckUtils]: 65: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,937 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {46809#true} {46994#(= main_~p~0 8)} #78#return; {46994#(= main_~p~0 8)} is VALID [2022-04-27 13:48:49,937 INFO L272 TraceCheckUtils]: 67: Hoare triple {46994#(= main_~p~0 8)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,937 INFO L290 TraceCheckUtils]: 68: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,937 INFO L290 TraceCheckUtils]: 69: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,937 INFO L290 TraceCheckUtils]: 70: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,937 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {46809#true} {46994#(= main_~p~0 8)} #80#return; {46994#(= main_~p~0 8)} is VALID [2022-04-27 13:48:49,937 INFO L272 TraceCheckUtils]: 72: Hoare triple {46994#(= main_~p~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,937 INFO L290 TraceCheckUtils]: 73: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,938 INFO L290 TraceCheckUtils]: 74: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,938 INFO L290 TraceCheckUtils]: 75: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,938 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {46809#true} {46994#(= main_~p~0 8)} #82#return; {46994#(= main_~p~0 8)} is VALID [2022-04-27 13:48:49,938 INFO L290 TraceCheckUtils]: 77: Hoare triple {46994#(= main_~p~0 8)} assume !(~r~0 >= ~d~0); {46994#(= main_~p~0 8)} is VALID [2022-04-27 13:48:49,938 INFO L290 TraceCheckUtils]: 78: Hoare triple {46994#(= main_~p~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46994#(= main_~p~0 8)} is VALID [2022-04-27 13:48:49,939 INFO L290 TraceCheckUtils]: 79: Hoare triple {46994#(= main_~p~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {46994#(= main_~p~0 8)} is VALID [2022-04-27 13:48:49,939 INFO L272 TraceCheckUtils]: 80: Hoare triple {46994#(= main_~p~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,939 INFO L290 TraceCheckUtils]: 82: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,939 INFO L290 TraceCheckUtils]: 83: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,951 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {46809#true} {46994#(= main_~p~0 8)} #84#return; {46994#(= main_~p~0 8)} is VALID [2022-04-27 13:48:49,952 INFO L272 TraceCheckUtils]: 85: Hoare triple {46994#(= main_~p~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,952 INFO L290 TraceCheckUtils]: 86: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,952 INFO L290 TraceCheckUtils]: 87: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,952 INFO L290 TraceCheckUtils]: 88: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,952 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {46809#true} {46994#(= main_~p~0 8)} #86#return; {46994#(= main_~p~0 8)} is VALID [2022-04-27 13:48:49,953 INFO L290 TraceCheckUtils]: 90: Hoare triple {46994#(= main_~p~0 8)} 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); {46939#(= main_~p~0 4)} is VALID [2022-04-27 13:48:49,953 INFO L290 TraceCheckUtils]: 91: Hoare triple {46939#(= main_~p~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46939#(= main_~p~0 4)} is VALID [2022-04-27 13:48:49,953 INFO L290 TraceCheckUtils]: 92: Hoare triple {46939#(= main_~p~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46939#(= main_~p~0 4)} is VALID [2022-04-27 13:48:49,954 INFO L290 TraceCheckUtils]: 93: Hoare triple {46939#(= main_~p~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {46939#(= main_~p~0 4)} is VALID [2022-04-27 13:48:49,954 INFO L272 TraceCheckUtils]: 94: Hoare triple {46939#(= main_~p~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,954 INFO L290 TraceCheckUtils]: 95: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,954 INFO L290 TraceCheckUtils]: 96: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,954 INFO L290 TraceCheckUtils]: 97: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,954 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {46809#true} {46939#(= main_~p~0 4)} #84#return; {46939#(= main_~p~0 4)} is VALID [2022-04-27 13:48:49,954 INFO L272 TraceCheckUtils]: 99: Hoare triple {46939#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,954 INFO L290 TraceCheckUtils]: 100: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,954 INFO L290 TraceCheckUtils]: 101: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,955 INFO L290 TraceCheckUtils]: 102: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,955 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {46809#true} {46939#(= main_~p~0 4)} #86#return; {46939#(= main_~p~0 4)} is VALID [2022-04-27 13:48:49,955 INFO L290 TraceCheckUtils]: 104: Hoare triple {46939#(= 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); {46884#(= main_~p~0 2)} is VALID [2022-04-27 13:48:49,956 INFO L290 TraceCheckUtils]: 105: Hoare triple {46884#(= main_~p~0 2)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46884#(= main_~p~0 2)} is VALID [2022-04-27 13:48:49,956 INFO L290 TraceCheckUtils]: 106: Hoare triple {46884#(= main_~p~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46884#(= main_~p~0 2)} is VALID [2022-04-27 13:48:49,956 INFO L290 TraceCheckUtils]: 107: Hoare triple {46884#(= main_~p~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {46884#(= main_~p~0 2)} is VALID [2022-04-27 13:48:49,956 INFO L272 TraceCheckUtils]: 108: Hoare triple {46884#(= main_~p~0 2)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,956 INFO L290 TraceCheckUtils]: 109: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,956 INFO L290 TraceCheckUtils]: 110: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,957 INFO L290 TraceCheckUtils]: 111: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,957 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {46809#true} {46884#(= main_~p~0 2)} #84#return; {46884#(= main_~p~0 2)} is VALID [2022-04-27 13:48:49,957 INFO L272 TraceCheckUtils]: 113: Hoare triple {46884#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,957 INFO L290 TraceCheckUtils]: 114: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,957 INFO L290 TraceCheckUtils]: 115: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,957 INFO L290 TraceCheckUtils]: 116: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,958 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {46809#true} {46884#(= main_~p~0 2)} #86#return; {46884#(= main_~p~0 2)} is VALID [2022-04-27 13:48:49,958 INFO L290 TraceCheckUtils]: 118: Hoare triple {46884#(= 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); {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:49,958 INFO L290 TraceCheckUtils]: 119: Hoare triple {46829#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:49,959 INFO L290 TraceCheckUtils]: 120: Hoare triple {46829#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:49,959 INFO L290 TraceCheckUtils]: 121: Hoare triple {46829#(= main_~p~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:49,959 INFO L272 TraceCheckUtils]: 122: Hoare triple {46829#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,959 INFO L290 TraceCheckUtils]: 123: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,959 INFO L290 TraceCheckUtils]: 124: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,959 INFO L290 TraceCheckUtils]: 125: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,959 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #84#return; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:49,960 INFO L272 TraceCheckUtils]: 127: Hoare triple {46829#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:49,960 INFO L290 TraceCheckUtils]: 128: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:49,960 INFO L290 TraceCheckUtils]: 129: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:49,960 INFO L290 TraceCheckUtils]: 130: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:49,960 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #86#return; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:49,960 INFO L290 TraceCheckUtils]: 132: Hoare triple {46829#(= 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); {46810#false} is VALID [2022-04-27 13:48:49,960 INFO L290 TraceCheckUtils]: 133: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L290 TraceCheckUtils]: 134: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L290 TraceCheckUtils]: 135: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L272 TraceCheckUtils]: 136: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L290 TraceCheckUtils]: 137: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L290 TraceCheckUtils]: 138: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L290 TraceCheckUtils]: 139: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L272 TraceCheckUtils]: 141: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L290 TraceCheckUtils]: 142: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L290 TraceCheckUtils]: 143: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L290 TraceCheckUtils]: 144: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L290 TraceCheckUtils]: 146: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L290 TraceCheckUtils]: 147: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L290 TraceCheckUtils]: 148: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L290 TraceCheckUtils]: 149: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,961 INFO L272 TraceCheckUtils]: 150: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L290 TraceCheckUtils]: 151: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L290 TraceCheckUtils]: 152: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L290 TraceCheckUtils]: 153: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L272 TraceCheckUtils]: 155: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L290 TraceCheckUtils]: 156: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L290 TraceCheckUtils]: 157: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L290 TraceCheckUtils]: 158: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L290 TraceCheckUtils]: 160: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L290 TraceCheckUtils]: 161: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L290 TraceCheckUtils]: 162: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L290 TraceCheckUtils]: 163: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L272 TraceCheckUtils]: 164: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L290 TraceCheckUtils]: 165: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,962 INFO L290 TraceCheckUtils]: 166: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L290 TraceCheckUtils]: 167: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L272 TraceCheckUtils]: 169: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L290 TraceCheckUtils]: 170: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L290 TraceCheckUtils]: 171: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L290 TraceCheckUtils]: 172: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L290 TraceCheckUtils]: 174: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L290 TraceCheckUtils]: 175: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L290 TraceCheckUtils]: 176: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L290 TraceCheckUtils]: 177: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L272 TraceCheckUtils]: 178: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L290 TraceCheckUtils]: 179: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L290 TraceCheckUtils]: 180: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L290 TraceCheckUtils]: 181: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,963 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L272 TraceCheckUtils]: 183: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L290 TraceCheckUtils]: 184: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L290 TraceCheckUtils]: 185: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L290 TraceCheckUtils]: 186: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L290 TraceCheckUtils]: 188: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L290 TraceCheckUtils]: 189: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L290 TraceCheckUtils]: 190: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L290 TraceCheckUtils]: 191: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L272 TraceCheckUtils]: 192: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L290 TraceCheckUtils]: 193: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L290 TraceCheckUtils]: 194: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L290 TraceCheckUtils]: 195: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L284 TraceCheckUtils]: 196: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L272 TraceCheckUtils]: 197: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L290 TraceCheckUtils]: 198: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,964 INFO L290 TraceCheckUtils]: 199: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L290 TraceCheckUtils]: 200: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L284 TraceCheckUtils]: 201: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L290 TraceCheckUtils]: 202: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L290 TraceCheckUtils]: 203: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L290 TraceCheckUtils]: 204: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L290 TraceCheckUtils]: 205: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L272 TraceCheckUtils]: 206: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L290 TraceCheckUtils]: 207: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L290 TraceCheckUtils]: 208: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L290 TraceCheckUtils]: 209: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L272 TraceCheckUtils]: 211: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L290 TraceCheckUtils]: 212: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L290 TraceCheckUtils]: 213: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L290 TraceCheckUtils]: 214: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:49,965 INFO L290 TraceCheckUtils]: 216: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L290 TraceCheckUtils]: 217: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L290 TraceCheckUtils]: 218: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L290 TraceCheckUtils]: 219: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L272 TraceCheckUtils]: 220: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L290 TraceCheckUtils]: 221: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L290 TraceCheckUtils]: 222: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L290 TraceCheckUtils]: 223: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L284 TraceCheckUtils]: 224: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L272 TraceCheckUtils]: 225: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L290 TraceCheckUtils]: 226: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L290 TraceCheckUtils]: 227: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L290 TraceCheckUtils]: 228: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L284 TraceCheckUtils]: 229: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L290 TraceCheckUtils]: 230: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L290 TraceCheckUtils]: 231: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L290 TraceCheckUtils]: 232: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,966 INFO L290 TraceCheckUtils]: 233: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L272 TraceCheckUtils]: 234: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L290 TraceCheckUtils]: 235: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L290 TraceCheckUtils]: 236: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L290 TraceCheckUtils]: 237: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L284 TraceCheckUtils]: 238: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L272 TraceCheckUtils]: 239: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L290 TraceCheckUtils]: 240: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L290 TraceCheckUtils]: 241: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L290 TraceCheckUtils]: 242: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L284 TraceCheckUtils]: 243: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L290 TraceCheckUtils]: 244: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L290 TraceCheckUtils]: 245: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L290 TraceCheckUtils]: 246: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L290 TraceCheckUtils]: 247: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L272 TraceCheckUtils]: 248: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L290 TraceCheckUtils]: 249: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,967 INFO L290 TraceCheckUtils]: 250: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L290 TraceCheckUtils]: 251: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L284 TraceCheckUtils]: 252: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L272 TraceCheckUtils]: 253: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L290 TraceCheckUtils]: 254: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L290 TraceCheckUtils]: 255: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L290 TraceCheckUtils]: 256: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L290 TraceCheckUtils]: 258: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L290 TraceCheckUtils]: 259: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L290 TraceCheckUtils]: 260: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L290 TraceCheckUtils]: 261: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L272 TraceCheckUtils]: 262: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L290 TraceCheckUtils]: 263: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L290 TraceCheckUtils]: 264: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L290 TraceCheckUtils]: 265: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:49,968 INFO L272 TraceCheckUtils]: 267: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L290 TraceCheckUtils]: 268: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L290 TraceCheckUtils]: 269: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L290 TraceCheckUtils]: 270: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L290 TraceCheckUtils]: 272: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L290 TraceCheckUtils]: 273: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L290 TraceCheckUtils]: 274: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L290 TraceCheckUtils]: 275: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L272 TraceCheckUtils]: 276: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L290 TraceCheckUtils]: 277: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L290 TraceCheckUtils]: 278: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L290 TraceCheckUtils]: 279: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L284 TraceCheckUtils]: 280: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L272 TraceCheckUtils]: 281: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L290 TraceCheckUtils]: 282: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L290 TraceCheckUtils]: 283: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,969 INFO L290 TraceCheckUtils]: 284: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L284 TraceCheckUtils]: 285: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L290 TraceCheckUtils]: 286: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L290 TraceCheckUtils]: 287: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L290 TraceCheckUtils]: 288: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L290 TraceCheckUtils]: 289: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L272 TraceCheckUtils]: 290: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L290 TraceCheckUtils]: 291: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L290 TraceCheckUtils]: 292: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L290 TraceCheckUtils]: 293: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L284 TraceCheckUtils]: 294: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L272 TraceCheckUtils]: 295: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L290 TraceCheckUtils]: 296: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L290 TraceCheckUtils]: 297: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L290 TraceCheckUtils]: 298: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L284 TraceCheckUtils]: 299: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L290 TraceCheckUtils]: 300: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:49,970 INFO L290 TraceCheckUtils]: 301: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:49,971 INFO L290 TraceCheckUtils]: 302: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,971 INFO L290 TraceCheckUtils]: 303: Hoare triple {46810#false} assume !(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:49,971 INFO L272 TraceCheckUtils]: 304: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:49,971 INFO L290 TraceCheckUtils]: 305: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:49,971 INFO L290 TraceCheckUtils]: 306: Hoare triple {46810#false} assume 0 == ~cond; {46810#false} is VALID [2022-04-27 13:48:49,971 INFO L290 TraceCheckUtils]: 307: Hoare triple {46810#false} assume !false; {46810#false} is VALID [2022-04-27 13:48:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4660 backedges. 2247 proven. 69 refuted. 0 times theorem prover too weak. 2344 trivial. 0 not checked. [2022-04-27 13:48:49,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:48:53,221 INFO L290 TraceCheckUtils]: 307: Hoare triple {46810#false} assume !false; {46810#false} is VALID [2022-04-27 13:48:53,221 INFO L290 TraceCheckUtils]: 306: Hoare triple {46810#false} assume 0 == ~cond; {46810#false} is VALID [2022-04-27 13:48:53,222 INFO L290 TraceCheckUtils]: 305: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-27 13:48:53,222 INFO L272 TraceCheckUtils]: 304: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {46810#false} is VALID [2022-04-27 13:48:53,222 INFO L290 TraceCheckUtils]: 303: Hoare triple {46810#false} assume !(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,222 INFO L290 TraceCheckUtils]: 302: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,222 INFO L290 TraceCheckUtils]: 301: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:53,222 INFO L290 TraceCheckUtils]: 300: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:53,222 INFO L284 TraceCheckUtils]: 299: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:53,222 INFO L290 TraceCheckUtils]: 298: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,222 INFO L290 TraceCheckUtils]: 297: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,222 INFO L290 TraceCheckUtils]: 296: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,222 INFO L272 TraceCheckUtils]: 295: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,222 INFO L284 TraceCheckUtils]: 294: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:53,222 INFO L290 TraceCheckUtils]: 293: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,222 INFO L290 TraceCheckUtils]: 292: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,222 INFO L290 TraceCheckUtils]: 291: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,222 INFO L272 TraceCheckUtils]: 290: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,222 INFO L290 TraceCheckUtils]: 289: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,223 INFO L290 TraceCheckUtils]: 288: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,223 INFO L290 TraceCheckUtils]: 287: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:53,223 INFO L290 TraceCheckUtils]: 286: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:53,223 INFO L284 TraceCheckUtils]: 285: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:53,223 INFO L290 TraceCheckUtils]: 284: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,223 INFO L290 TraceCheckUtils]: 283: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,223 INFO L290 TraceCheckUtils]: 282: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,223 INFO L272 TraceCheckUtils]: 281: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,223 INFO L284 TraceCheckUtils]: 280: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:53,223 INFO L290 TraceCheckUtils]: 279: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,223 INFO L290 TraceCheckUtils]: 278: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,223 INFO L290 TraceCheckUtils]: 277: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,223 INFO L272 TraceCheckUtils]: 276: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,223 INFO L290 TraceCheckUtils]: 275: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,223 INFO L290 TraceCheckUtils]: 274: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,223 INFO L290 TraceCheckUtils]: 273: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:53,223 INFO L290 TraceCheckUtils]: 272: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:53,224 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:53,224 INFO L290 TraceCheckUtils]: 270: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,224 INFO L290 TraceCheckUtils]: 269: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,224 INFO L290 TraceCheckUtils]: 268: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,224 INFO L272 TraceCheckUtils]: 267: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,224 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:53,224 INFO L290 TraceCheckUtils]: 265: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,224 INFO L290 TraceCheckUtils]: 264: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,224 INFO L290 TraceCheckUtils]: 263: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,224 INFO L272 TraceCheckUtils]: 262: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,224 INFO L290 TraceCheckUtils]: 261: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,224 INFO L290 TraceCheckUtils]: 260: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,224 INFO L290 TraceCheckUtils]: 259: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:53,224 INFO L290 TraceCheckUtils]: 258: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:53,224 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:53,224 INFO L290 TraceCheckUtils]: 256: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,224 INFO L290 TraceCheckUtils]: 255: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,224 INFO L290 TraceCheckUtils]: 254: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,225 INFO L272 TraceCheckUtils]: 253: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,225 INFO L284 TraceCheckUtils]: 252: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:53,225 INFO L290 TraceCheckUtils]: 251: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,225 INFO L290 TraceCheckUtils]: 250: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,225 INFO L290 TraceCheckUtils]: 249: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,225 INFO L272 TraceCheckUtils]: 248: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,225 INFO L290 TraceCheckUtils]: 247: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,225 INFO L290 TraceCheckUtils]: 246: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,225 INFO L290 TraceCheckUtils]: 245: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:53,225 INFO L290 TraceCheckUtils]: 244: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:53,225 INFO L284 TraceCheckUtils]: 243: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:53,225 INFO L290 TraceCheckUtils]: 242: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,225 INFO L290 TraceCheckUtils]: 241: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,225 INFO L290 TraceCheckUtils]: 240: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,225 INFO L272 TraceCheckUtils]: 239: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,225 INFO L284 TraceCheckUtils]: 238: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:53,225 INFO L290 TraceCheckUtils]: 237: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,226 INFO L290 TraceCheckUtils]: 236: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,226 INFO L290 TraceCheckUtils]: 235: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,226 INFO L272 TraceCheckUtils]: 234: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,226 INFO L290 TraceCheckUtils]: 233: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,226 INFO L290 TraceCheckUtils]: 232: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,226 INFO L290 TraceCheckUtils]: 231: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:53,226 INFO L290 TraceCheckUtils]: 230: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:53,226 INFO L284 TraceCheckUtils]: 229: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:53,226 INFO L290 TraceCheckUtils]: 228: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,226 INFO L290 TraceCheckUtils]: 227: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,226 INFO L290 TraceCheckUtils]: 226: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,226 INFO L272 TraceCheckUtils]: 225: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,226 INFO L284 TraceCheckUtils]: 224: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:53,226 INFO L290 TraceCheckUtils]: 223: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,226 INFO L290 TraceCheckUtils]: 222: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,226 INFO L290 TraceCheckUtils]: 221: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,226 INFO L272 TraceCheckUtils]: 220: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 219: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 218: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 217: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 216: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:53,227 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 214: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 213: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 212: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,227 INFO L272 TraceCheckUtils]: 211: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,227 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 209: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 208: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 207: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,227 INFO L272 TraceCheckUtils]: 206: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 205: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 204: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 203: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:53,227 INFO L290 TraceCheckUtils]: 202: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:53,228 INFO L284 TraceCheckUtils]: 201: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:53,228 INFO L290 TraceCheckUtils]: 200: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,228 INFO L290 TraceCheckUtils]: 199: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,228 INFO L290 TraceCheckUtils]: 198: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,228 INFO L272 TraceCheckUtils]: 197: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,228 INFO L284 TraceCheckUtils]: 196: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:53,228 INFO L290 TraceCheckUtils]: 195: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,228 INFO L290 TraceCheckUtils]: 194: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,228 INFO L290 TraceCheckUtils]: 193: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,228 INFO L272 TraceCheckUtils]: 192: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,228 INFO L290 TraceCheckUtils]: 191: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,228 INFO L290 TraceCheckUtils]: 190: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,228 INFO L290 TraceCheckUtils]: 189: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:53,228 INFO L290 TraceCheckUtils]: 188: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:53,228 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:53,228 INFO L290 TraceCheckUtils]: 186: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,229 INFO L290 TraceCheckUtils]: 185: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,229 INFO L290 TraceCheckUtils]: 184: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,229 INFO L272 TraceCheckUtils]: 183: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,229 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:53,229 INFO L290 TraceCheckUtils]: 181: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,229 INFO L290 TraceCheckUtils]: 180: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,229 INFO L290 TraceCheckUtils]: 179: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,229 INFO L272 TraceCheckUtils]: 178: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,229 INFO L290 TraceCheckUtils]: 177: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,229 INFO L290 TraceCheckUtils]: 176: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,229 INFO L290 TraceCheckUtils]: 175: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:53,229 INFO L290 TraceCheckUtils]: 174: Hoare triple {46810#false} 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); {46810#false} is VALID [2022-04-27 13:48:53,229 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-27 13:48:53,229 INFO L290 TraceCheckUtils]: 172: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,229 INFO L290 TraceCheckUtils]: 171: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,229 INFO L290 TraceCheckUtils]: 170: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,230 INFO L272 TraceCheckUtils]: 169: Hoare triple {46810#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,230 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-27 13:48:53,230 INFO L290 TraceCheckUtils]: 167: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,230 INFO L290 TraceCheckUtils]: 166: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,230 INFO L290 TraceCheckUtils]: 165: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,230 INFO L272 TraceCheckUtils]: 164: Hoare triple {46810#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,230 INFO L290 TraceCheckUtils]: 163: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,230 INFO L290 TraceCheckUtils]: 162: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-27 13:48:53,230 INFO L290 TraceCheckUtils]: 161: Hoare triple {46810#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46810#false} is VALID [2022-04-27 13:48:53,239 INFO L290 TraceCheckUtils]: 160: Hoare triple {46829#(= 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); {46810#false} is VALID [2022-04-27 13:48:53,240 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #86#return; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:53,240 INFO L290 TraceCheckUtils]: 158: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,240 INFO L290 TraceCheckUtils]: 157: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,240 INFO L290 TraceCheckUtils]: 156: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,240 INFO L272 TraceCheckUtils]: 155: Hoare triple {46829#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,240 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #84#return; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:53,241 INFO L290 TraceCheckUtils]: 153: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,241 INFO L290 TraceCheckUtils]: 152: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,241 INFO L290 TraceCheckUtils]: 151: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,241 INFO L272 TraceCheckUtils]: 150: Hoare triple {46829#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,241 INFO L290 TraceCheckUtils]: 149: Hoare triple {46829#(= main_~p~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:53,241 INFO L290 TraceCheckUtils]: 148: Hoare triple {46829#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:53,241 INFO L290 TraceCheckUtils]: 147: Hoare triple {46829#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:53,242 INFO L290 TraceCheckUtils]: 146: Hoare triple {48222#(or (= (div main_~p~0 2) 1) (= 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); {46829#(= main_~p~0 1)} is VALID [2022-04-27 13:48:53,243 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {46809#true} {48222#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} #86#return; {48222#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,243 INFO L290 TraceCheckUtils]: 144: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,243 INFO L290 TraceCheckUtils]: 143: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,243 INFO L290 TraceCheckUtils]: 142: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,243 INFO L272 TraceCheckUtils]: 141: Hoare triple {48222#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,243 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {46809#true} {48222#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} #84#return; {48222#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,243 INFO L290 TraceCheckUtils]: 139: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,243 INFO L290 TraceCheckUtils]: 138: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,244 INFO L290 TraceCheckUtils]: 137: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,244 INFO L272 TraceCheckUtils]: 136: Hoare triple {48222#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,244 INFO L290 TraceCheckUtils]: 135: Hoare triple {48222#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {48222#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,244 INFO L290 TraceCheckUtils]: 134: Hoare triple {48222#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48222#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,244 INFO L290 TraceCheckUtils]: 133: Hoare triple {48222#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {48222#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,246 INFO L290 TraceCheckUtils]: 132: Hoare triple {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= 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); {48222#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,246 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {46809#true} {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} #86#return; {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,246 INFO L290 TraceCheckUtils]: 130: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,246 INFO L290 TraceCheckUtils]: 129: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,246 INFO L290 TraceCheckUtils]: 128: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,246 INFO L272 TraceCheckUtils]: 127: Hoare triple {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,247 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {46809#true} {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} #84#return; {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,247 INFO L290 TraceCheckUtils]: 125: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,247 INFO L290 TraceCheckUtils]: 124: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,247 INFO L290 TraceCheckUtils]: 123: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,247 INFO L272 TraceCheckUtils]: 122: Hoare triple {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,248 INFO L290 TraceCheckUtils]: 121: Hoare triple {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,248 INFO L290 TraceCheckUtils]: 120: Hoare triple {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,248 INFO L290 TraceCheckUtils]: 119: Hoare triple {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,251 INFO L290 TraceCheckUtils]: 118: Hoare triple {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= 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); {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,252 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {46809#true} {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} #86#return; {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,252 INFO L290 TraceCheckUtils]: 116: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,252 INFO L290 TraceCheckUtils]: 115: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,252 INFO L290 TraceCheckUtils]: 114: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,252 INFO L272 TraceCheckUtils]: 113: Hoare triple {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,252 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {46809#true} {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} #84#return; {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,253 INFO L290 TraceCheckUtils]: 111: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,253 INFO L290 TraceCheckUtils]: 110: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,253 INFO L290 TraceCheckUtils]: 109: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,253 INFO L272 TraceCheckUtils]: 108: Hoare triple {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,254 INFO L290 TraceCheckUtils]: 107: Hoare triple {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,255 INFO L290 TraceCheckUtils]: 106: Hoare triple {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,256 INFO L290 TraceCheckUtils]: 105: Hoare triple {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,260 INFO L290 TraceCheckUtils]: 104: Hoare triple {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 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); {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,261 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {46809#true} {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #86#return; {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,261 INFO L290 TraceCheckUtils]: 102: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,261 INFO L290 TraceCheckUtils]: 101: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,261 INFO L290 TraceCheckUtils]: 100: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,261 INFO L272 TraceCheckUtils]: 99: Hoare triple {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,262 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {46809#true} {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #84#return; {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,262 INFO L290 TraceCheckUtils]: 97: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,262 INFO L290 TraceCheckUtils]: 96: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,262 INFO L290 TraceCheckUtils]: 95: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,262 INFO L272 TraceCheckUtils]: 94: Hoare triple {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,263 INFO L290 TraceCheckUtils]: 93: Hoare triple {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} assume !!(#t~post6 < 20);havoc #t~post6; {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,264 INFO L290 TraceCheckUtils]: 92: Hoare triple {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,265 INFO L290 TraceCheckUtils]: 91: Hoare triple {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,269 INFO L290 TraceCheckUtils]: 90: Hoare triple {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 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); {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,270 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {46809#true} {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #86#return; {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,270 INFO L290 TraceCheckUtils]: 88: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,270 INFO L290 TraceCheckUtils]: 87: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,270 INFO L290 TraceCheckUtils]: 86: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,270 INFO L272 TraceCheckUtils]: 85: Hoare triple {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,271 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {46809#true} {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #84#return; {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,271 INFO L290 TraceCheckUtils]: 83: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,271 INFO L290 TraceCheckUtils]: 82: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,271 INFO L290 TraceCheckUtils]: 81: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,271 INFO L272 TraceCheckUtils]: 80: Hoare triple {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,272 INFO L290 TraceCheckUtils]: 79: Hoare triple {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} assume !!(#t~post6 < 20);havoc #t~post6; {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,273 INFO L290 TraceCheckUtils]: 78: Hoare triple {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,274 INFO L290 TraceCheckUtils]: 77: Hoare triple {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} assume !(~r~0 >= ~d~0); {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,274 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {46809#true} {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #82#return; {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,275 INFO L290 TraceCheckUtils]: 75: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,275 INFO L290 TraceCheckUtils]: 74: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,275 INFO L290 TraceCheckUtils]: 73: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,275 INFO L272 TraceCheckUtils]: 72: Hoare triple {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,275 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {46809#true} {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #80#return; {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,275 INFO L290 TraceCheckUtils]: 70: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,275 INFO L290 TraceCheckUtils]: 69: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,275 INFO L290 TraceCheckUtils]: 68: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,275 INFO L272 TraceCheckUtils]: 67: Hoare triple {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,276 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {46809#true} {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #78#return; {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,276 INFO L290 TraceCheckUtils]: 65: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,276 INFO L290 TraceCheckUtils]: 64: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,276 INFO L290 TraceCheckUtils]: 63: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,276 INFO L272 TraceCheckUtils]: 62: Hoare triple {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,277 INFO L290 TraceCheckUtils]: 61: Hoare triple {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} assume !!(#t~post5 < 20);havoc #t~post5; {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,278 INFO L290 TraceCheckUtils]: 60: Hoare triple {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,282 INFO L290 TraceCheckUtils]: 59: Hoare triple {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {48394#(or (and (<= 0 (div (+ (- 2) (div (div (div (div main_~p~0 2) 2) 2) 2)) 2)) (<= (div (+ (- 1) (* (- 1) (div (div (div (div main_~p~0 2) 2) 2) 2))) (- 2)) 2)) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,283 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {46809#true} {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #82#return; {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,283 INFO L290 TraceCheckUtils]: 57: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,283 INFO L290 TraceCheckUtils]: 55: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,283 INFO L272 TraceCheckUtils]: 54: Hoare triple {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,283 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {46809#true} {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #80#return; {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,284 INFO L290 TraceCheckUtils]: 50: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,284 INFO L272 TraceCheckUtils]: 49: Hoare triple {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,284 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {46809#true} {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #78#return; {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,284 INFO L290 TraceCheckUtils]: 47: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,284 INFO L290 TraceCheckUtils]: 46: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,284 INFO L272 TraceCheckUtils]: 44: Hoare triple {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} assume !!(#t~post5 < 20);havoc #t~post5; {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,290 INFO L290 TraceCheckUtils]: 41: Hoare triple {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {48351#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))))} is VALID [2022-04-27 13:48:53,290 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {46809#true} {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} #82#return; {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,291 INFO L272 TraceCheckUtils]: 36: Hoare triple {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,291 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {46809#true} {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} #80#return; {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,291 INFO L272 TraceCheckUtils]: 31: Hoare triple {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,292 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {46809#true} {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} #78#return; {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,292 INFO L272 TraceCheckUtils]: 26: Hoare triple {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {48308#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,306 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {46809#true} {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} #82#return; {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,306 INFO L272 TraceCheckUtils]: 18: Hoare triple {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,306 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {46809#true} {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} #80#return; {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,307 INFO L272 TraceCheckUtils]: 13: Hoare triple {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,307 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {46809#true} {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} #78#return; {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-27 13:48:53,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-27 13:48:53,307 INFO L272 TraceCheckUtils]: 8: Hoare triple {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46809#true} is VALID [2022-04-27 13:48:53,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {46809#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {48265#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (= main_~p~0 1))} is VALID [2022-04-27 13:48:53,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {46809#true} call #t~ret7 := main(); {46809#true} is VALID [2022-04-27 13:48:53,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46809#true} {46809#true} #92#return; {46809#true} is VALID [2022-04-27 13:48:53,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-27 13:48:53,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {46809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {46809#true} is VALID [2022-04-27 13:48:53,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {46809#true} call ULTIMATE.init(); {46809#true} is VALID [2022-04-27 13:48:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4660 backedges. 491 proven. 85 refuted. 0 times theorem prover too weak. 4084 trivial. 0 not checked. [2022-04-27 13:48:53,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:48:53,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358461963] [2022-04-27 13:48:53,311 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:48:53,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702992420] [2022-04-27 13:48:53,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702992420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:48:53,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:48:53,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2022-04-27 13:48:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649572042] [2022-04-27 13:48:53,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:48:53,312 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 11 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (47), 11 states have call predecessors, (47), 11 states have call successors, (47) Word has length 308