/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-34549b5 [2022-04-07 14:30:34,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 14:30:34,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 14:30:35,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 14:30:35,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 14:30:35,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 14:30:35,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 14:30:35,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 14:30:35,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 14:30:35,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 14:30:35,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 14:30:35,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 14:30:35,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 14:30:35,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 14:30:35,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 14:30:35,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 14:30:35,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 14:30:35,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 14:30:35,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 14:30:35,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 14:30:35,028 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 14:30:35,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 14:30:35,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 14:30:35,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 14:30:35,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 14:30:35,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 14:30:35,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 14:30:35,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 14:30:35,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 14:30:35,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 14:30:35,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 14:30:35,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 14:30:35,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 14:30:35,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 14:30:35,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 14:30:35,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 14:30:35,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 14:30:35,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 14:30:35,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 14:30:35,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 14:30:35,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 14:30:35,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 14:30:35,044 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-07 14:30:35,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 14:30:35,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 14:30:35,065 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 14:30:35,065 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 14:30:35,066 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 14:30:35,066 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 14:30:35,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 14:30:35,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 14:30:35,066 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 14:30:35,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 14:30:35,067 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 14:30:35,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 14:30:35,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 14:30:35,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 14:30:35,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 14:30:35,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 14:30:35,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 14:30:35,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 14:30:35,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 14:30:35,068 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 14:30:35,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 14:30:35,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 14:30:35,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 14:30:35,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 14:30:35,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 14:30:35,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 14:30:35,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 14:30:35,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 14:30:35,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 14:30:35,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 14:30:35,070 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 14:30:35,070 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 14:30:35,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 14:30:35,070 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-07 14:30:35,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 14:30:35,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 14:30:35,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 14:30:35,252 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 14:30:35,252 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 14:30:35,253 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-07 14:30:35,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5002f3019/89f3d803a05d40cd8d6d4c0921cdf4d4/FLAGb87d37e74 [2022-04-07 14:30:35,644 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 14:30:35,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound20.c [2022-04-07 14:30:35,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5002f3019/89f3d803a05d40cd8d6d4c0921cdf4d4/FLAGb87d37e74 [2022-04-07 14:30:35,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5002f3019/89f3d803a05d40cd8d6d4c0921cdf4d4 [2022-04-07 14:30:35,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 14:30:35,664 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 14:30:35,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 14:30:35,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 14:30:35,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 14:30:35,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:30:35" (1/1) ... [2022-04-07 14:30:35,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@361e5795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:30:35, skipping insertion in model container [2022-04-07 14:30:35,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:30:35" (1/1) ... [2022-04-07 14:30:35,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 14:30:35,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 14:30:35,809 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-07 14:30:35,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 14:30:35,828 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 14:30:35,851 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-07 14:30:35,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 14:30:35,868 INFO L208 MainTranslator]: Completed translation [2022-04-07 14:30:35,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:30:35 WrapperNode [2022-04-07 14:30:35,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 14:30:35,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 14:30:35,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 14:30:35,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 14:30:35,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:30:35" (1/1) ... [2022-04-07 14:30:35,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:30:35" (1/1) ... [2022-04-07 14:30:35,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:30:35" (1/1) ... [2022-04-07 14:30:35,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:30:35" (1/1) ... [2022-04-07 14:30:35,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:30:35" (1/1) ... [2022-04-07 14:30:35,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:30:35" (1/1) ... [2022-04-07 14:30:35,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:30:35" (1/1) ... [2022-04-07 14:30:35,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 14:30:35,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 14:30:35,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 14:30:35,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 14:30:35,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:30:35" (1/1) ... [2022-04-07 14:30:35,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 14:30:35,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:30:35,928 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-07 14:30:35,949 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-07 14:30:35,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 14:30:35,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 14:30:35,956 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 14:30:35,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 14:30:35,958 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 14:30:35,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 14:30:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 14:30:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 14:30:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 14:30:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 14:30:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 14:30:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 14:30:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 14:30:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 14:30:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 14:30:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 14:30:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 14:30:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 14:30:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 14:30:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 14:30:36,004 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 14:30:36,006 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 14:30:36,170 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 14:30:36,190 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 14:30:36,190 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 14:30:36,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:30:36 BoogieIcfgContainer [2022-04-07 14:30:36,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 14:30:36,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 14:30:36,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 14:30:36,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 14:30:36,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 02:30:35" (1/3) ... [2022-04-07 14:30:36,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659d8c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:30:36, skipping insertion in model container [2022-04-07 14:30:36,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:30:35" (2/3) ... [2022-04-07 14:30:36,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659d8c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:30:36, skipping insertion in model container [2022-04-07 14:30:36,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:30:36" (3/3) ... [2022-04-07 14:30:36,196 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound20.c [2022-04-07 14:30:36,199 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 14:30:36,200 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 14:30:36,246 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 14:30:36,252 INFO L340 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 [2022-04-07 14:30:36,252 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 14:30:36,271 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-07 14:30:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 14:30:36,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:30:36,274 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:30:36,275 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:30:36,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:30:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-07 14:30:36,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:30:36,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630686667] [2022-04-07 14:30:36,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:36,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:30:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 14:30:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:36,438 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-07 14:30:36,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-07 14:30:36,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-07 14:30:36,441 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-07 14:30:36,441 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-07 14:30:36,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-07 14:30:36,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-07 14:30:36,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-07 14:30:36,442 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-07 14:30:36,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-07 14:30:36,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-07 14:30:36,443 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-07 14:30:36,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-07 14:30:36,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-07 14:30:36,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-07 14:30:36,444 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-07 14:30:36,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:30:36,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630686667] [2022-04-07 14:30:36,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630686667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:30:36,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:30:36,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 14:30:36,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134535343] [2022-04-07 14:30:36,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:30:36,452 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-07 14:30:36,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:30:36,455 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-07 14:30:36,477 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-07 14:30:36,477 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 14:30:36,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:30:36,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 14:30:36,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 14:30:36,501 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-07 14:30:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:36,671 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-07 14:30:36,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 14:30:36,671 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-07 14:30:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:30:36,672 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-07 14:30:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-07 14:30:36,684 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-07 14:30:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-07 14:30:36,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-07 14:30:36,812 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-07 14:30:36,818 INFO L225 Difference]: With dead ends: 57 [2022-04-07 14:30:36,818 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 14:30:36,820 INFO L912 BasicCegarLoop]: 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-07 14:30:36,822 INFO L913 BasicCegarLoop]: 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-07 14:30:36,823 INFO L914 BasicCegarLoop]: 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-07 14:30:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 14:30:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-07 14:30:36,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:30:36,842 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-07 14:30:36,842 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-07 14:30:36,843 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-07 14:30:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:36,848 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-07 14:30:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-07 14:30:36,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:36,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:36,849 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-07 14:30:36,850 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-07 14:30:36,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:36,852 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-07 14:30:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-07 14:30:36,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:36,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:36,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:30:36,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:30:36,854 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-07 14:30:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-07 14:30:36,857 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-07 14:30:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:30:36,857 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-07 14:30:36,857 INFO L479 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-07 14:30:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-07 14:30:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 14:30:36,858 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:30:36,858 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:30:36,858 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 14:30:36,858 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:30:36,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:30:36,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-07 14:30:36,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:30:36,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130520772] [2022-04-07 14:30:36,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:36,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:30:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:36,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 14:30:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:36,980 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-07 14:30:36,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-07 14:30:36,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215#true} {215#true} #92#return; {215#true} is VALID [2022-04-07 14:30:36,981 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-07 14:30:36,981 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-07 14:30:36,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-07 14:30:36,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #92#return; {215#true} is VALID [2022-04-07 14:30:36,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret7 := main(); {215#true} is VALID [2022-04-07 14:30:36,982 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-07 14:30:36,983 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-07 14:30:36,983 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-07 14:30:36,984 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-07 14:30:36,985 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-07 14:30:36,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {222#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {216#false} is VALID [2022-04-07 14:30:36,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-04-07 14:30:36,985 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-07 14:30:36,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:30:36,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130520772] [2022-04-07 14:30:36,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130520772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:30:36,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:30:36,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 14:30:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190516920] [2022-04-07 14:30:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:30:36,988 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-07 14:30:36,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:30:36,989 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-07 14:30:36,997 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-07 14:30:36,997 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 14:30:36,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:30:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 14:30:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 14:30:36,998 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-07 14:30:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:37,310 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-07 14:30:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 14:30:37,311 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-07 14:30:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:30:37,311 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-07 14:30:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-07 14:30:37,319 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-07 14:30:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-07 14:30:37,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-07 14:30:37,372 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-07 14:30:37,376 INFO L225 Difference]: With dead ends: 41 [2022-04-07 14:30:37,376 INFO L226 Difference]: Without dead ends: 39 [2022-04-07 14:30:37,379 INFO L912 BasicCegarLoop]: 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-07 14:30:37,381 INFO L913 BasicCegarLoop]: 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-07 14:30:37,382 INFO L914 BasicCegarLoop]: 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-07 14:30:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-07 14:30:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-07 14:30:37,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:30:37,394 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-07 14:30:37,395 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-07 14:30:37,395 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-07 14:30:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:37,400 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-07 14:30:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-07 14:30:37,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:37,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:37,405 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-07 14:30:37,407 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-07 14:30:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:37,414 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-07 14:30:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-07 14:30:37,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:37,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:37,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:30:37,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:30:37,417 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-07 14:30:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-07 14:30:37,420 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-07 14:30:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:30:37,420 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-07 14:30:37,421 INFO L479 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-07 14:30:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-07 14:30:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 14:30:37,422 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:30:37,422 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:30:37,422 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 14:30:37,422 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:30:37,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:30:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-07 14:30:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:30:37,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170179818] [2022-04-07 14:30:37,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:37,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:30:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:37,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 14:30:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:37,514 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-07 14:30:37,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#(<= ~counter~0 0)} assume true; {421#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:37,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} #92#return; {421#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:37,516 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-07 14:30:37,516 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-07 14:30:37,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#(<= ~counter~0 0)} assume true; {421#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:37,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} #92#return; {421#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:37,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {421#(<= ~counter~0 0)} call #t~ret7 := main(); {421#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:37,518 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-07 14:30:37,519 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-07 14:30:37,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {417#false} is VALID [2022-04-07 14:30:37,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {417#false} is VALID [2022-04-07 14:30:37,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#false} assume !(#t~post6 < 20);havoc #t~post6; {417#false} is VALID [2022-04-07 14:30:37,520 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-07 14:30:37,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {417#false} ~cond := #in~cond; {417#false} is VALID [2022-04-07 14:30:37,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#false} assume 0 == ~cond; {417#false} is VALID [2022-04-07 14:30:37,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#false} assume !false; {417#false} is VALID [2022-04-07 14:30:37,521 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-07 14:30:37,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:30:37,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170179818] [2022-04-07 14:30:37,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170179818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:30:37,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:30:37,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 14:30:37,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959605399] [2022-04-07 14:30:37,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:30:37,525 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-07 14:30:37,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:30:37,530 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-07 14:30:37,539 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-07 14:30:37,539 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:30:37,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:30:37,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:30:37,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:30:37,540 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-07 14:30:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:37,689 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-07 14:30:37,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 14:30:37,689 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-07 14:30:37,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:30:37,689 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-07 14:30:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-07 14:30:37,691 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-07 14:30:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-07 14:30:37,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-07 14:30:37,733 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-07 14:30:37,735 INFO L225 Difference]: With dead ends: 46 [2022-04-07 14:30:37,735 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 14:30:37,736 INFO L912 BasicCegarLoop]: 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-07 14:30:37,736 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-07 14:30:37,737 INFO L914 BasicCegarLoop]: 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-07 14:30:37,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 14:30:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 14:30:37,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:30:37,742 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-07 14:30:37,742 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-07 14:30:37,743 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-07 14:30:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:37,746 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-07 14:30:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 14:30:37,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:37,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:37,747 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-07 14:30:37,748 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-07 14:30:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:37,751 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-07 14:30:37,751 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 14:30:37,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:37,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:37,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:30:37,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:30:37,752 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-07 14:30:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-07 14:30:37,754 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-07 14:30:37,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:30:37,754 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-07 14:30:37,755 INFO L479 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-07 14:30:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 14:30:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 14:30:37,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:30:37,755 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:30:37,755 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 14:30:37,756 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:30:37,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:30:37,756 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-07 14:30:37,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:30:37,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886162621] [2022-04-07 14:30:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:37,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:30:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:37,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 14:30:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:37,809 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-07 14:30:37,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-07 14:30:37,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-07 14:30:37,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-07 14:30:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:37,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-07 14:30:37,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-07 14:30:37,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-07 14:30:37,814 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-07 14:30:37,814 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-07 14:30:37,815 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-07 14:30:37,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-07 14:30:37,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-07 14:30:37,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret7 := main(); {605#true} is VALID [2022-04-07 14:30:37,815 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-07 14:30:37,816 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-07 14:30:37,816 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-07 14:30:37,816 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-07 14:30:37,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-07 14:30:37,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-07 14:30:37,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-07 14:30:37,817 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-07 14:30:37,817 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-07 14:30:37,818 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-07 14:30:37,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {606#false} is VALID [2022-04-07 14:30:37,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {606#false} assume !false; {606#false} is VALID [2022-04-07 14:30:37,819 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-07 14:30:37,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:30:37,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886162621] [2022-04-07 14:30:37,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886162621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:30:37,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:30:37,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 14:30:37,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846565812] [2022-04-07 14:30:37,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:30:37,820 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-07 14:30:37,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:30:37,820 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-07 14:30:37,832 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-07 14:30:37,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 14:30:37,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:30:37,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 14:30:37,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 14:30:37,833 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-07 14:30:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:38,065 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-07 14:30:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 14:30:38,066 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-07 14:30:38,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:30:38,067 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-07 14:30:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-07 14:30:38,069 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-07 14:30:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-07 14:30:38,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-07 14:30:38,107 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-07 14:30:38,108 INFO L225 Difference]: With dead ends: 46 [2022-04-07 14:30:38,108 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 14:30:38,109 INFO L912 BasicCegarLoop]: 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-07 14:30:38,111 INFO L913 BasicCegarLoop]: 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-07 14:30:38,111 INFO L914 BasicCegarLoop]: 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-07 14:30:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 14:30:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-07 14:30:38,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:30:38,116 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-07 14:30:38,116 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-07 14:30:38,117 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-07 14:30:38,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:38,118 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-07 14:30:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-07 14:30:38,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:38,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:38,119 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-07 14:30:38,119 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-07 14:30:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:38,120 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-07 14:30:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-07 14:30:38,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:38,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:38,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:30:38,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:30:38,121 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-07 14:30:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-07 14:30:38,122 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-07 14:30:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:30:38,122 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-07 14:30:38,122 INFO L479 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-07 14:30:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-07 14:30:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 14:30:38,122 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:30:38,123 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:30:38,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 14:30:38,123 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:30:38,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:30:38,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-07 14:30:38,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:30:38,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237384169] [2022-04-07 14:30:38,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:38,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:30:38,131 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:30:38,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1906616902] [2022-04-07 14:30:38,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:38,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:30:38,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:30:38,132 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-07 14:30:38,133 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-07 14:30:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:38,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 14:30:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:38,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:30:38,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} call ULTIMATE.init(); {834#true} is VALID [2022-04-07 14:30:38,342 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-07 14:30:38,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-07 14:30:38,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} #92#return; {834#true} is VALID [2022-04-07 14:30:38,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} call #t~ret7 := main(); {834#true} is VALID [2022-04-07 14:30:38,343 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-07 14:30:38,343 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-07 14:30:38,344 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-07 14:30:38,344 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-07 14:30:38,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#true} ~cond := #in~cond; {834#true} is VALID [2022-04-07 14:30:38,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {834#true} assume !(0 == ~cond); {834#true} is VALID [2022-04-07 14:30:38,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-07 14:30:38,345 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-07 14:30:38,345 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-07 14:30:38,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {834#true} ~cond := #in~cond; {834#true} is VALID [2022-04-07 14:30:38,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#true} assume !(0 == ~cond); {834#true} is VALID [2022-04-07 14:30:38,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-07 14:30:38,346 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-07 14:30:38,347 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-07 14:30:38,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:30:38,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {835#false} is VALID [2022-04-07 14:30:38,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {835#false} assume !false; {835#false} is VALID [2022-04-07 14:30:38,348 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-07 14:30:38,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:30:38,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:30:38,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237384169] [2022-04-07 14:30:38,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:30:38,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906616902] [2022-04-07 14:30:38,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906616902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:30:38,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:30:38,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 14:30:38,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676470500] [2022-04-07 14:30:38,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:30:38,349 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-07 14:30:38,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:30:38,349 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-07 14:30:38,368 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-07 14:30:38,368 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:30:38,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:30:38,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:30:38,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:30:38,369 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-07 14:30:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:38,546 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-07 14:30:38,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:30:38,547 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-07 14:30:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:30:38,547 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-07 14:30:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-07 14:30:38,549 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-07 14:30:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-07 14:30:38,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-07 14:30:38,624 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-07 14:30:38,625 INFO L225 Difference]: With dead ends: 65 [2022-04-07 14:30:38,625 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 14:30:38,626 INFO L912 BasicCegarLoop]: 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-07 14:30:38,627 INFO L913 BasicCegarLoop]: 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-07 14:30:38,627 INFO L914 BasicCegarLoop]: 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-07 14:30:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 14:30:38,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-07 14:30:38,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:30:38,637 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-07 14:30:38,638 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-07 14:30:38,638 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-07 14:30:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:38,641 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-07 14:30:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-07 14:30:38,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:38,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:38,642 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-07 14:30:38,642 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-07 14:30:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:38,645 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-07 14:30:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-07 14:30:38,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:38,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:38,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:30:38,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:30:38,646 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-07 14:30:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-07 14:30:38,648 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-07 14:30:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:30:38,648 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-07 14:30:38,649 INFO L479 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-07 14:30:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-07 14:30:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 14:30:38,649 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:30:38,649 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:30:38,679 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-07 14:30:38,867 WARN L460 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-07 14:30:38,868 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:30:38,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:30:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-07 14:30:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:30:38,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337777505] [2022-04-07 14:30:38,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:30:38,879 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:30:38,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1452771931] [2022-04-07 14:30:38,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:38,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:30:38,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:30:38,880 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-07 14:30:38,903 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-07 14:30:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:38,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 14:30:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:38,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:30:39,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1173#true} is VALID [2022-04-07 14:30:39,088 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-07 14:30:39,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#(<= ~counter~0 0)} assume true; {1181#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:39,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#(<= ~counter~0 0)} {1173#true} #92#return; {1181#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:39,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#(<= ~counter~0 0)} call #t~ret7 := main(); {1181#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:39,089 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-07 14:30:39,090 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-07 14:30:39,090 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-07 14:30:39,091 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-07 14:30:39,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:39,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:39,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:39,094 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #78#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:39,095 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-07 14:30:39,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:39,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:39,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:39,096 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #80#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:39,097 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-07 14:30:39,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:39,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:39,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:39,099 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #82#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:39,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {1197#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1197#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:39,100 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-07 14:30:39,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {1252#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {1174#false} is VALID [2022-04-07 14:30:39,102 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-07 14:30:39,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {1174#false} ~cond := #in~cond; {1174#false} is VALID [2022-04-07 14:30:39,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {1174#false} assume 0 == ~cond; {1174#false} is VALID [2022-04-07 14:30:39,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-07 14:30:39,102 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-07 14:30:39,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:30:39,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:30:39,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337777505] [2022-04-07 14:30:39,103 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:30:39,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452771931] [2022-04-07 14:30:39,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452771931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:30:39,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:30:39,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 14:30:39,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392453976] [2022-04-07 14:30:39,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:30:39,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-07 14:30:39,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:30:39,104 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-07 14:30:39,130 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-07 14:30:39,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:30:39,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:30:39,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:30:39,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:30:39,131 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-07 14:30:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:39,227 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-07 14:30:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:30:39,228 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-07 14:30:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:30:39,230 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-07 14:30:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-07 14:30:39,231 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-07 14:30:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-07 14:30:39,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-07 14:30:39,276 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-07 14:30:39,278 INFO L225 Difference]: With dead ends: 70 [2022-04-07 14:30:39,278 INFO L226 Difference]: Without dead ends: 63 [2022-04-07 14:30:39,278 INFO L912 BasicCegarLoop]: 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-07 14:30:39,282 INFO L913 BasicCegarLoop]: 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-07 14:30:39,283 INFO L914 BasicCegarLoop]: 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-07 14:30:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-07 14:30:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-07 14:30:39,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:30:39,306 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-07 14:30:39,306 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-07 14:30:39,307 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-07 14:30:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:39,309 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-07 14:30:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-07 14:30:39,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:39,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:39,310 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-07 14:30:39,311 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-07 14:30:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:39,312 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-07 14:30:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-07 14:30:39,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:39,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:39,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:30:39,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:30:39,313 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-07 14:30:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-07 14:30:39,315 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-07 14:30:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:30:39,316 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-07 14:30:39,316 INFO L479 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-07 14:30:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-07 14:30:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 14:30:39,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:30:39,316 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:30:39,333 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-07 14:30:39,527 WARN L460 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-07 14:30:39,527 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:30:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:30:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-07 14:30:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:30:39,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639536091] [2022-04-07 14:30:39,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:30:39,536 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:30:39,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1650044600] [2022-04-07 14:30:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:39,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:30:39,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:30:39,537 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-07 14:30:39,538 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-07 14:30:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:39,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 14:30:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:39,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:30:39,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {1580#true} call ULTIMATE.init(); {1580#true} is VALID [2022-04-07 14:30:39,713 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-07 14:30:39,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-07 14:30:39,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1580#true} {1580#true} #92#return; {1580#true} is VALID [2022-04-07 14:30:39,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {1580#true} call #t~ret7 := main(); {1580#true} is VALID [2022-04-07 14:30:39,714 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-07 14:30:39,714 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-07 14:30:39,714 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-07 14:30:39,714 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-07 14:30:39,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-07 14:30:39,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-07 14:30:39,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-07 14:30:39,715 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-07 14:30:39,715 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-07 14:30:39,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-07 14:30:39,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-07 14:30:39,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-07 14:30:39,716 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-07 14:30:39,716 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-07 14:30:39,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-07 14:30:39,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-07 14:30:39,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-07 14:30:39,717 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-07 14:30:39,717 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-07 14:30:39,718 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-07 14:30:39,718 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-07 14:30:39,719 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-07 14:30:39,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {1664#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1668#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:30:39,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {1668#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1581#false} is VALID [2022-04-07 14:30:39,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {1581#false} assume !false; {1581#false} is VALID [2022-04-07 14:30:39,720 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-07 14:30:39,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:30:39,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:30:39,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639536091] [2022-04-07 14:30:39,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:30:39,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650044600] [2022-04-07 14:30:39,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650044600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:30:39,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:30:39,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 14:30:39,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067958825] [2022-04-07 14:30:39,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:30:39,721 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-07 14:30:39,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:30:39,721 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-07 14:30:39,736 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-07 14:30:39,736 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:30:39,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:30:39,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:30:39,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:30:39,736 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-07 14:30:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:39,888 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-07 14:30:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:30:39,888 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-07 14:30:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:30:39,889 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-07 14:30:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-07 14:30:39,890 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-07 14:30:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-07 14:30:39,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-07 14:30:39,926 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-07 14:30:39,927 INFO L225 Difference]: With dead ends: 76 [2022-04-07 14:30:39,927 INFO L226 Difference]: Without dead ends: 64 [2022-04-07 14:30:39,927 INFO L912 BasicCegarLoop]: 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-07 14:30:39,928 INFO L913 BasicCegarLoop]: 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-07 14:30:39,928 INFO L914 BasicCegarLoop]: 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-07 14:30:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-07 14:30:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-07 14:30:39,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:30:39,944 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-07 14:30:39,944 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-07 14:30:39,944 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-07 14:30:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:39,946 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-07 14:30:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-07 14:30:39,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:39,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:39,947 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-07 14:30:39,947 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-07 14:30:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:39,948 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-07 14:30:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-07 14:30:39,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:39,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:39,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:30:39,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:30:39,949 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-07 14:30:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-07 14:30:39,950 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-07 14:30:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:30:39,950 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-07 14:30:39,950 INFO L479 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-07 14:30:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-07 14:30:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 14:30:39,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:30:39,951 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:30:39,970 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-07 14:30:40,158 WARN L460 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-07 14:30:40,158 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:30:40,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:30:40,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-07 14:30:40,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:30:40,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259828852] [2022-04-07 14:30:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:40,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:30:40,171 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:30:40,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1882848995] [2022-04-07 14:30:40,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:40,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:30:40,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:30:40,172 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-07 14:30:40,173 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-07 14:30:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:40,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 14:30:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:40,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:30:40,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-07 14:30:40,350 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-07 14:30:40,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {2008#(<= ~counter~0 0)} assume true; {2008#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:40,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2008#(<= ~counter~0 0)} {2000#true} #92#return; {2008#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:40,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {2008#(<= ~counter~0 0)} call #t~ret7 := main(); {2008#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:40,351 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-07 14:30:40,352 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-07 14:30:40,352 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-07 14:30:40,353 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-07 14:30:40,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:40,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:40,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:40,354 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #78#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:40,354 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-07 14:30:40,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:40,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:40,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:40,357 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #80#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:40,357 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-07 14:30:40,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:40,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:40,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:40,358 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #82#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:40,359 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-07 14:30:40,359 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-07 14:30:40,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {2079#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {2001#false} is VALID [2022-04-07 14:30:40,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {2001#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2001#false} is VALID [2022-04-07 14:30:40,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} assume !(#t~post6 < 20);havoc #t~post6; {2001#false} is VALID [2022-04-07 14:30:40,360 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-07 14:30:40,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-07 14:30:40,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {2001#false} assume !(0 == ~cond); {2001#false} is VALID [2022-04-07 14:30:40,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {2001#false} assume true; {2001#false} is VALID [2022-04-07 14:30:40,362 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2001#false} {2001#false} #88#return; {2001#false} is VALID [2022-04-07 14:30:40,362 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-07 14:30:40,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-07 14:30:40,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} assume 0 == ~cond; {2001#false} is VALID [2022-04-07 14:30:40,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-07 14:30:40,363 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-07 14:30:40,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:30:40,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-07 14:30:40,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} assume 0 == ~cond; {2001#false} is VALID [2022-04-07 14:30:40,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-07 14:30:40,549 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-07 14:30:40,549 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2000#true} {2001#false} #88#return; {2001#false} is VALID [2022-04-07 14:30:40,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-07 14:30:40,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-07 14:30:40,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-07 14:30:40,550 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-07 14:30:40,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} assume !(#t~post6 < 20);havoc #t~post6; {2001#false} is VALID [2022-04-07 14:30:40,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {2001#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2001#false} is VALID [2022-04-07 14:30:40,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {2149#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2001#false} is VALID [2022-04-07 14:30:40,554 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-07 14:30:40,554 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-07 14:30:40,554 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2000#true} {2153#(< ~counter~0 20)} #82#return; {2153#(< ~counter~0 20)} is VALID [2022-04-07 14:30:40,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-07 14:30:40,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-07 14:30:40,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-07 14:30:40,555 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-07 14:30:40,555 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2000#true} {2153#(< ~counter~0 20)} #80#return; {2153#(< ~counter~0 20)} is VALID [2022-04-07 14:30:40,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-07 14:30:40,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-07 14:30:40,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-07 14:30:40,556 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-07 14:30:40,556 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2000#true} {2153#(< ~counter~0 20)} #78#return; {2153#(< ~counter~0 20)} is VALID [2022-04-07 14:30:40,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-07 14:30:40,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-07 14:30:40,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-07 14:30:40,556 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-07 14:30:40,557 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-07 14:30:40,557 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-07 14:30:40,558 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-07 14:30:40,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {2208#(< ~counter~0 19)} call #t~ret7 := main(); {2208#(< ~counter~0 19)} is VALID [2022-04-07 14:30:40,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2208#(< ~counter~0 19)} {2000#true} #92#return; {2208#(< ~counter~0 19)} is VALID [2022-04-07 14:30:40,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {2208#(< ~counter~0 19)} assume true; {2208#(< ~counter~0 19)} is VALID [2022-04-07 14:30:40,560 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-07 14:30:40,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-07 14:30:40,560 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-07 14:30:40,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:30:40,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259828852] [2022-04-07 14:30:40,560 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:30:40,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882848995] [2022-04-07 14:30:40,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882848995] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:30:40,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:30:40,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 14:30:40,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385926458] [2022-04-07 14:30:40,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:30:40,561 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-07 14:30:40,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:30:40,561 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-07 14:30:40,606 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-07 14:30:40,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 14:30:40,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:30:40,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 14:30:40,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 14:30:40,607 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-07 14:30:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:40,815 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2022-04-07 14:30:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 14:30:40,816 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-07 14:30:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:30:40,816 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-07 14:30:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-07 14:30:40,818 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-07 14:30:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-07 14:30:40,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-07 14:30:40,901 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-07 14:30:40,903 INFO L225 Difference]: With dead ends: 144 [2022-04-07 14:30:40,903 INFO L226 Difference]: Without dead ends: 119 [2022-04-07 14:30:40,904 INFO L912 BasicCegarLoop]: 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-07 14:30:40,904 INFO L913 BasicCegarLoop]: 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-07 14:30:40,904 INFO L914 BasicCegarLoop]: 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-07 14:30:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-07 14:30:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-04-07 14:30:40,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:30:40,936 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-07 14:30:40,936 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-07 14:30:40,937 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-07 14:30:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:40,939 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2022-04-07 14:30:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2022-04-07 14:30:40,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:40,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:40,940 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-07 14:30:40,940 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-07 14:30:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:40,942 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2022-04-07 14:30:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2022-04-07 14:30:40,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:40,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:40,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:30:40,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:30:40,943 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-07 14:30:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-04-07 14:30:40,945 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 37 [2022-04-07 14:30:40,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:30:40,946 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-04-07 14:30:40,946 INFO L479 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-07 14:30:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-07 14:30:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-07 14:30:40,946 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:30:40,946 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:30:40,983 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-07 14:30:41,147 WARN L460 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-07 14:30:41,147 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:30:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:30:41,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-07 14:30:41,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:30:41,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189869680] [2022-04-07 14:30:41,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:41,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:30:41,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:30:41,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245385619] [2022-04-07 14:30:41,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:41,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:30:41,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:30:41,165 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-07 14:30:41,166 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-07 14:30:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:41,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 14:30:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:41,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:30:41,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {2830#true} call ULTIMATE.init(); {2830#true} is VALID [2022-04-07 14:30:41,370 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-07 14:30:41,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-07 14:30:41,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2830#true} {2830#true} #92#return; {2830#true} is VALID [2022-04-07 14:30:41,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {2830#true} call #t~ret7 := main(); {2830#true} is VALID [2022-04-07 14:30:41,371 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-07 14:30:41,371 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-07 14:30:41,371 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-07 14:30:41,371 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-07 14:30:41,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-07 14:30:41,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-07 14:30:41,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-07 14:30:41,372 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-07 14:30:41,372 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-07 14:30:41,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-07 14:30:41,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-07 14:30:41,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-07 14:30:41,377 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-07 14:30:41,378 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-07 14:30:41,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-07 14:30:41,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-07 14:30:41,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-07 14:30:41,382 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-07 14:30:41,384 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-07 14:30:41,384 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-07 14:30:41,385 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-07 14:30:41,386 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-07 14:30:41,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-07 14:30:41,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-07 14:30:41,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-07 14:30:41,388 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-07 14:30:41,388 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-07 14:30:41,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-07 14:30:41,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-07 14:30:41,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-07 14:30:41,389 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-07 14:30:41,390 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-07 14:30:41,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:30:41,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {2949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2831#false} is VALID [2022-04-07 14:30:41,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {2831#false} assume !false; {2831#false} is VALID [2022-04-07 14:30:41,390 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-07 14:30:41,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:30:41,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {2831#false} assume !false; {2831#false} is VALID [2022-04-07 14:30:41,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {2949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2831#false} is VALID [2022-04-07 14:30:41,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:30:41,552 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-07 14:30:41,553 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-07 14:30:41,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-07 14:30:41,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-07 14:30:41,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-07 14:30:41,553 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-07 14:30:41,554 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-07 14:30:41,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-07 14:30:41,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-07 14:30:41,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-07 14:30:41,554 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-07 14:30:41,554 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-07 14:30:41,555 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-07 14:30:41,557 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-07 14:30:41,558 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-07 14:30:41,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-07 14:30:41,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-07 14:30:41,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-07 14:30:41,558 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-07 14:30:41,558 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-07 14:30:41,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-07 14:30:41,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-07 14:30:41,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-07 14:30:41,559 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-07 14:30:41,559 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-07 14:30:41,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-07 14:30:41,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-07 14:30:41,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-07 14:30:41,560 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-07 14:30:41,560 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-07 14:30:41,560 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-07 14:30:41,561 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-07 14:30:41,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {2830#true} call #t~ret7 := main(); {2830#true} is VALID [2022-04-07 14:30:41,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2830#true} {2830#true} #92#return; {2830#true} is VALID [2022-04-07 14:30:41,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-07 14:30:41,561 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-07 14:30:41,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {2830#true} call ULTIMATE.init(); {2830#true} is VALID [2022-04-07 14:30:41,561 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-07 14:30:41,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:30:41,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189869680] [2022-04-07 14:30:41,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:30:41,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245385619] [2022-04-07 14:30:41,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245385619] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 14:30:41,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 14:30:41,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-07 14:30:41,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927700557] [2022-04-07 14:30:41,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:30:41,563 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-07 14:30:41,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:30:41,563 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-07 14:30:41,577 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-07 14:30:41,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:30:41,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:30:41,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:30:41,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 14:30:41,578 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-07 14:30:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:43,848 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2022-04-07 14:30:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:30:43,848 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-07 14:30:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:30:43,848 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-07 14:30:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-07 14:30:43,849 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-07 14:30:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-07 14:30:43,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-07 14:30:43,911 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-07 14:30:43,913 INFO L225 Difference]: With dead ends: 129 [2022-04-07 14:30:43,913 INFO L226 Difference]: Without dead ends: 125 [2022-04-07 14:30:43,914 INFO L912 BasicCegarLoop]: 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-07 14:30:43,914 INFO L913 BasicCegarLoop]: 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-07 14:30:43,914 INFO L914 BasicCegarLoop]: 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-07 14:30:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-07 14:30:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2022-04-07 14:30:43,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:30:43,941 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-07 14:30:43,941 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-07 14:30:43,941 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-07 14:30:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:43,944 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-04-07 14:30:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-04-07 14:30:43,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:43,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:43,944 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-07 14:30:43,945 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-07 14:30:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:43,947 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-04-07 14:30:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-04-07 14:30:43,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:43,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:43,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:30:43,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:30:43,948 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-07 14:30:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2022-04-07 14:30:43,950 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 40 [2022-04-07 14:30:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:30:43,950 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2022-04-07 14:30:43,950 INFO L479 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-07 14:30:43,950 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2022-04-07 14:30:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-07 14:30:43,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:30:43,951 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:30:43,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 14:30:44,163 WARN L460 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-07 14:30:44,163 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:30:44,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:30:44,164 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-07 14:30:44,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:30:44,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103624026] [2022-04-07 14:30:44,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:44,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:30:44,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:30:44,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1572753052] [2022-04-07 14:30:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:44,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:30:44,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:30:44,174 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-07 14:30:44,175 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-07 14:30:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:44,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 14:30:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:44,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:30:44,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2022-04-07 14:30:44,471 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-07 14:30:44,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {3689#(<= ~counter~0 0)} assume true; {3689#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:44,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3689#(<= ~counter~0 0)} {3681#true} #92#return; {3689#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:44,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {3689#(<= ~counter~0 0)} call #t~ret7 := main(); {3689#(<= ~counter~0 0)} is VALID [2022-04-07 14:30:44,472 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-07 14:30:44,473 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-07 14:30:44,473 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-07 14:30:44,474 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-07 14:30:44,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:44,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:44,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:44,475 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3705#(<= ~counter~0 1)} {3705#(<= ~counter~0 1)} #78#return; {3705#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:44,476 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-07 14:30:44,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:44,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:44,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:44,477 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3705#(<= ~counter~0 1)} {3705#(<= ~counter~0 1)} #80#return; {3705#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:44,477 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-07 14:30:44,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:44,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:44,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:44,479 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3705#(<= ~counter~0 1)} {3705#(<= ~counter~0 1)} #82#return; {3705#(<= ~counter~0 1)} is VALID [2022-04-07 14:30:44,479 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-07 14:30:44,479 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-07 14:30:44,480 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-07 14:30:44,480 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-07 14:30:44,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-07 14:30:44,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-07 14:30:44,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-07 14:30:44,481 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3760#(<= ~counter~0 2)} {3760#(<= ~counter~0 2)} #78#return; {3760#(<= ~counter~0 2)} is VALID [2022-04-07 14:30:44,481 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-07 14:30:44,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-07 14:30:44,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-07 14:30:44,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-07 14:30:44,483 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3760#(<= ~counter~0 2)} {3760#(<= ~counter~0 2)} #80#return; {3760#(<= ~counter~0 2)} is VALID [2022-04-07 14:30:44,483 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-07 14:30:44,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-07 14:30:44,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-07 14:30:44,484 INFO L290 TraceCheckUtils]: 39: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-07 14:30:44,484 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3760#(<= ~counter~0 2)} {3760#(<= ~counter~0 2)} #82#return; {3760#(<= ~counter~0 2)} is VALID [2022-04-07 14:30:44,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {3760#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {3760#(<= ~counter~0 2)} is VALID [2022-04-07 14:30:44,485 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-07 14:30:44,486 INFO L290 TraceCheckUtils]: 43: Hoare triple {3815#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {3682#false} is VALID [2022-04-07 14:30:44,486 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-07 14:30:44,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-07 14:30:44,486 INFO L290 TraceCheckUtils]: 46: Hoare triple {3682#false} assume !(0 == ~cond); {3682#false} is VALID [2022-04-07 14:30:44,486 INFO L290 TraceCheckUtils]: 47: Hoare triple {3682#false} assume true; {3682#false} is VALID [2022-04-07 14:30:44,486 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3682#false} {3682#false} #88#return; {3682#false} is VALID [2022-04-07 14:30:44,486 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-07 14:30:44,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-07 14:30:44,486 INFO L290 TraceCheckUtils]: 51: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2022-04-07 14:30:44,486 INFO L290 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2022-04-07 14:30:44,487 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-07 14:30:44,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:30:44,702 INFO L290 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2022-04-07 14:30:44,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2022-04-07 14:30:44,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-07 14:30:44,703 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-07 14:30:44,703 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3681#true} {3682#false} #88#return; {3682#false} is VALID [2022-04-07 14:30:44,703 INFO L290 TraceCheckUtils]: 47: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-07 14:30:44,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-07 14:30:44,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-07 14:30:44,703 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-07 14:30:44,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {3873#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {3682#false} is VALID [2022-04-07 14:30:44,707 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-07 14:30:44,708 INFO L290 TraceCheckUtils]: 41: Hoare triple {3877#(< ~counter~0 20)} assume !(~r~0 >= ~d~0); {3877#(< ~counter~0 20)} is VALID [2022-04-07 14:30:44,708 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3681#true} {3877#(< ~counter~0 20)} #82#return; {3877#(< ~counter~0 20)} is VALID [2022-04-07 14:30:44,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-07 14:30:44,708 INFO L290 TraceCheckUtils]: 38: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-07 14:30:44,709 INFO L290 TraceCheckUtils]: 37: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-07 14:30:44,709 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-07 14:30:44,709 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3681#true} {3877#(< ~counter~0 20)} #80#return; {3877#(< ~counter~0 20)} is VALID [2022-04-07 14:30:44,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-07 14:30:44,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-07 14:30:44,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-07 14:30:44,709 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-07 14:30:44,710 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3681#true} {3877#(< ~counter~0 20)} #78#return; {3877#(< ~counter~0 20)} is VALID [2022-04-07 14:30:44,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-07 14:30:44,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-07 14:30:44,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-07 14:30:44,710 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-07 14:30:44,710 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-07 14:30:44,711 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-07 14:30:44,711 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-07 14:30:44,712 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3681#true} {3932#(< ~counter~0 19)} #82#return; {3932#(< ~counter~0 19)} is VALID [2022-04-07 14:30:44,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-07 14:30:44,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-07 14:30:44,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-07 14:30:44,712 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-07 14:30:44,712 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3681#true} {3932#(< ~counter~0 19)} #80#return; {3932#(< ~counter~0 19)} is VALID [2022-04-07 14:30:44,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-07 14:30:44,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-07 14:30:44,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-07 14:30:44,713 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-07 14:30:44,713 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3681#true} {3932#(< ~counter~0 19)} #78#return; {3932#(< ~counter~0 19)} is VALID [2022-04-07 14:30:44,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-07 14:30:44,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-07 14:30:44,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-07 14:30:44,713 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-07 14:30:44,713 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-07 14:30:44,714 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-07 14:30:44,714 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-07 14:30:44,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {3987#(< ~counter~0 18)} call #t~ret7 := main(); {3987#(< ~counter~0 18)} is VALID [2022-04-07 14:30:44,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3987#(< ~counter~0 18)} {3681#true} #92#return; {3987#(< ~counter~0 18)} is VALID [2022-04-07 14:30:44,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {3987#(< ~counter~0 18)} assume true; {3987#(< ~counter~0 18)} is VALID [2022-04-07 14:30:44,716 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-07 14:30:44,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2022-04-07 14:30:44,716 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-07 14:30:44,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:30:44,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103624026] [2022-04-07 14:30:44,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:30:44,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572753052] [2022-04-07 14:30:44,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572753052] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:30:44,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:30:44,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-07 14:30:44,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833871777] [2022-04-07 14:30:44,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:30:44,717 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-07 14:30:44,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:30:44,718 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-07 14:30:44,764 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-07 14:30:44,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 14:30:44,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:30:44,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 14:30:44,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:30:44,765 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-07 14:30:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:45,224 INFO L93 Difference]: Finished difference Result 245 states and 298 transitions. [2022-04-07 14:30:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 14:30:45,224 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-07 14:30:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:30:45,224 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-07 14:30:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-07 14:30:45,226 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-07 14:30:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-07 14:30:45,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-07 14:30:45,346 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-07 14:30:45,350 INFO L225 Difference]: With dead ends: 245 [2022-04-07 14:30:45,350 INFO L226 Difference]: Without dead ends: 224 [2022-04-07 14:30:45,350 INFO L912 BasicCegarLoop]: 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-07 14:30:45,351 INFO L913 BasicCegarLoop]: 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-07 14:30:45,351 INFO L914 BasicCegarLoop]: 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-07 14:30:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-07 14:30:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 217. [2022-04-07 14:30:45,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:30:45,412 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-07 14:30:45,412 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-07 14:30:45,412 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-07 14:30:45,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:45,416 INFO L93 Difference]: Finished difference Result 224 states and 267 transitions. [2022-04-07 14:30:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 267 transitions. [2022-04-07 14:30:45,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:45,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:45,417 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-07 14:30:45,417 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-07 14:30:45,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:45,421 INFO L93 Difference]: Finished difference Result 224 states and 267 transitions. [2022-04-07 14:30:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 267 transitions. [2022-04-07 14:30:45,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:45,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:45,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:30:45,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:30:45,422 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-07 14:30:45,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 263 transitions. [2022-04-07 14:30:45,425 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 263 transitions. Word has length 53 [2022-04-07 14:30:45,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:30:45,425 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 263 transitions. [2022-04-07 14:30:45,426 INFO L479 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-07 14:30:45,426 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 263 transitions. [2022-04-07 14:30:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-07 14:30:45,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:30:45,426 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:30:45,445 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-07 14:30:45,635 WARN L460 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-07 14:30:45,636 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:30:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:30:45,636 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 1 times [2022-04-07 14:30:45,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:30:45,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798012207] [2022-04-07 14:30:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:45,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:30:45,648 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:30:45,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457488331] [2022-04-07 14:30:45,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:45,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:30:45,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:30:45,649 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-07 14:30:45,650 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-07 14:30:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:45,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 14:30:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:45,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:30:46,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {5104#true} call ULTIMATE.init(); {5104#true} is VALID [2022-04-07 14:30:46,149 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-07 14:30:46,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:46,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5104#true} {5104#true} #92#return; {5104#true} is VALID [2022-04-07 14:30:46,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {5104#true} call #t~ret7 := main(); {5104#true} is VALID [2022-04-07 14:30:46,149 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-07 14:30:46,150 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-07 14:30:46,150 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-07 14:30:46,150 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-07 14:30:46,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:46,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:46,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:46,151 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-07 14:30:46,151 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-07 14:30:46,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:46,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:46,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:46,152 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-07 14:30:46,152 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-07 14:30:46,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:46,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:46,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:46,152 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-07 14:30:46,153 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-07 14:30:46,153 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-07 14:30:46,154 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-07 14:30:46,154 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-07 14:30:46,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:46,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:46,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:46,154 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-07 14:30:46,154 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-07 14:30:46,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:46,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:46,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:46,155 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-07 14:30:46,155 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-07 14:30:46,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:46,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:46,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:46,156 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-07 14:30:46,156 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-07 14:30:46,157 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-07 14:30:46,157 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-07 14:30:46,157 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-07 14:30:46,157 INFO L290 TraceCheckUtils]: 45: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:46,157 INFO L290 TraceCheckUtils]: 46: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:46,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:46,158 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-07 14:30:46,158 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-07 14:30:46,158 INFO L290 TraceCheckUtils]: 50: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:46,158 INFO L290 TraceCheckUtils]: 51: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:46,158 INFO L290 TraceCheckUtils]: 52: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:46,159 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-07 14:30:46,159 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-07 14:30:46,160 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-07 14:30:46,160 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-07 14:30:46,160 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-07 14:30:46,161 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-07 14:30:46,161 INFO L290 TraceCheckUtils]: 59: Hoare triple {5286#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:30:46,161 INFO L290 TraceCheckUtils]: 60: Hoare triple {5290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5105#false} is VALID [2022-04-07 14:30:46,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {5105#false} assume !false; {5105#false} is VALID [2022-04-07 14:30:46,162 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-07 14:30:46,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:30:47,222 INFO L290 TraceCheckUtils]: 61: Hoare triple {5105#false} assume !false; {5105#false} is VALID [2022-04-07 14:30:47,223 INFO L290 TraceCheckUtils]: 60: Hoare triple {5290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5105#false} is VALID [2022-04-07 14:30:47,223 INFO L290 TraceCheckUtils]: 59: Hoare triple {5286#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:30:47,223 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-07 14:30:47,224 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-07 14:30:47,224 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-07 14:30:47,239 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-07 14:30:47,260 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-07 14:30:47,261 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-07 14:30:47,261 INFO L290 TraceCheckUtils]: 52: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:47,261 INFO L290 TraceCheckUtils]: 51: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:47,261 INFO L290 TraceCheckUtils]: 50: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:47,261 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-07 14:30:47,262 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-07 14:30:47,262 INFO L290 TraceCheckUtils]: 47: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:47,262 INFO L290 TraceCheckUtils]: 46: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:47,262 INFO L290 TraceCheckUtils]: 45: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:47,262 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-07 14:30:47,263 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-07 14:30:47,264 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-07 14:30:47,265 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-07 14:30:47,265 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-07 14:30:47,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:47,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:47,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:47,266 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-07 14:30:47,266 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-07 14:30:47,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:47,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:47,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:47,266 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-07 14:30:47,267 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-07 14:30:47,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:47,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:47,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:47,267 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-07 14:30:47,269 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-07 14:30:47,270 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-07 14:30:47,277 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-07 14:30:47,278 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-07 14:30:47,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:47,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:47,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:47,278 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-07 14:30:47,279 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-07 14:30:47,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:47,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:47,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:47,279 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-07 14:30:47,279 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-07 14:30:47,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:47,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-07 14:30:47,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-07 14:30:47,280 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-07 14:30:47,280 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-07 14:30:47,280 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-07 14:30:47,281 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-07 14:30:47,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {5104#true} call #t~ret7 := main(); {5104#true} is VALID [2022-04-07 14:30:47,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5104#true} {5104#true} #92#return; {5104#true} is VALID [2022-04-07 14:30:47,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-07 14:30:47,281 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-07 14:30:47,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {5104#true} call ULTIMATE.init(); {5104#true} is VALID [2022-04-07 14:30:47,282 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-07 14:30:47,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:30:47,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798012207] [2022-04-07 14:30:47,282 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:30:47,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457488331] [2022-04-07 14:30:47,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457488331] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:30:47,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:30:47,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-07 14:30:47,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318293710] [2022-04-07 14:30:47,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:30:47,283 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-07 14:30:47,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:30:47,283 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-07 14:30:47,373 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-07 14:30:47,374 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 14:30:47,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:30:47,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 14:30:47,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:30:47,374 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-07 14:30:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:52,552 INFO L93 Difference]: Finished difference Result 371 states and 479 transitions. [2022-04-07 14:30:52,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 14:30:52,552 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-07 14:30:52,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:30:52,552 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-07 14:30:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2022-04-07 14:30:52,554 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-07 14:30:52,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2022-04-07 14:30:52,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 153 transitions. [2022-04-07 14:30:52,748 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-07 14:30:52,754 INFO L225 Difference]: With dead ends: 371 [2022-04-07 14:30:52,754 INFO L226 Difference]: Without dead ends: 303 [2022-04-07 14:30:52,755 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-07 14:30:52,755 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 52 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-07 14:30:52,756 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 204 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-07 14:30:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-07 14:30:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 274. [2022-04-07 14:30:52,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:30:52,838 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-07 14:30:52,839 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-07 14:30:52,839 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-07 14:30:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:52,845 INFO L93 Difference]: Finished difference Result 303 states and 382 transitions. [2022-04-07 14:30:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 382 transitions. [2022-04-07 14:30:52,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:52,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:52,846 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-07 14:30:52,846 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-07 14:30:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:30:52,852 INFO L93 Difference]: Finished difference Result 303 states and 382 transitions. [2022-04-07 14:30:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 382 transitions. [2022-04-07 14:30:52,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:30:52,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:30:52,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:30:52,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:30:52,853 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-07 14:30:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 341 transitions. [2022-04-07 14:30:52,858 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 341 transitions. Word has length 62 [2022-04-07 14:30:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:30:52,859 INFO L478 AbstractCegarLoop]: Abstraction has 274 states and 341 transitions. [2022-04-07 14:30:52,859 INFO L479 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-07 14:30:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 341 transitions. [2022-04-07 14:30:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-07 14:30:52,859 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:30:52,859 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:30:52,881 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-07 14:30:53,075 WARN L460 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-07 14:30:53,075 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:30:53,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:30:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 1 times [2022-04-07 14:30:53,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:30:53,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937780393] [2022-04-07 14:30:53,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:30:53,085 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:30:53,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106328919] [2022-04-07 14:30:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:30:53,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:30:53,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:30:53,086 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-07 14:30:53,087 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-07 14:30:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:53,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-07 14:30:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:30:53,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:30:53,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {6981#true} call ULTIMATE.init(); {6981#true} is VALID [2022-04-07 14:30:53,714 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-07 14:30:53,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:30:53,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6981#true} {6981#true} #92#return; {6981#true} is VALID [2022-04-07 14:30:53,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {6981#true} call #t~ret7 := main(); {6981#true} is VALID [2022-04-07 14:30:53,714 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-07 14:30:53,715 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-07 14:30:53,715 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-07 14:30:53,715 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-07 14:30:53,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:30:53,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:30:53,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:30:53,716 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-07 14:30:53,716 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-07 14:30:53,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:30:53,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:30:53,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:30:53,716 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-07 14:30:53,716 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-07 14:30:53,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:30:53,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:30:53,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:30:53,717 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-07 14:30:53,717 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-07 14:30:53,718 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-07 14:30:53,718 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-07 14:30:53,718 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-07 14:30:53,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:30:53,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:30:53,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:30:53,719 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-07 14:30:53,719 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-07 14:30:53,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:30:53,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:30:53,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:30:53,719 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-07 14:30:53,719 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-07 14:30:53,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:30:53,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:30:53,720 INFO L290 TraceCheckUtils]: 39: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:30:53,720 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-07 14:30:53,720 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-07 14:30:53,721 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-07 14:30:53,721 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-07 14:30:53,721 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-07 14:30:53,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:30:53,722 INFO L290 TraceCheckUtils]: 46: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:30:53,722 INFO L290 TraceCheckUtils]: 47: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:30:53,722 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-07 14:30:53,722 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-07 14:30:53,723 INFO L290 TraceCheckUtils]: 50: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:30:53,723 INFO L290 TraceCheckUtils]: 51: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:30:53,723 INFO L290 TraceCheckUtils]: 52: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:30:53,723 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-07 14:30:53,724 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-07 14:30:53,724 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-07 14:30:53,725 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-07 14:30:53,725 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-07 14:30:53,725 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-07 14:30:53,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {6981#true} ~cond := #in~cond; {7166#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:30:53,725 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-07 14:30:53,726 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-07 14:30:53,726 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-07 14:30:53,726 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-07 14:30:53,727 INFO L290 TraceCheckUtils]: 64: Hoare triple {6981#true} ~cond := #in~cond; {7166#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:30:53,727 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-07 14:30:53,727 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-07 14:30:53,728 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-07 14:30:53,728 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-07 14:30:53,729 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-07 14:30:53,729 INFO L290 TraceCheckUtils]: 70: Hoare triple {7201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:30:53,729 INFO L290 TraceCheckUtils]: 71: Hoare triple {7205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6982#false} is VALID [2022-04-07 14:30:53,729 INFO L290 TraceCheckUtils]: 72: Hoare triple {6982#false} assume !false; {6982#false} is VALID [2022-04-07 14:30:53,730 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-07 14:30:53,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:31:05,865 INFO L290 TraceCheckUtils]: 72: Hoare triple {6982#false} assume !false; {6982#false} is VALID [2022-04-07 14:31:05,866 INFO L290 TraceCheckUtils]: 71: Hoare triple {7205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6982#false} is VALID [2022-04-07 14:31:05,866 INFO L290 TraceCheckUtils]: 70: Hoare triple {7201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:31:05,867 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-07 14:31:05,867 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-07 14:31:05,868 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-07 14:31:05,868 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-07 14:31:05,869 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-07 14:31:05,869 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-07 14:31:05,869 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-07 14:31:05,871 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-07 14:31:05,871 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-07 14:31:05,872 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-07 14:31:05,872 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-07 14:31:05,872 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-07 14:31:05,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {6981#true} assume !!(#t~post6 < 20);havoc #t~post6; {6981#true} is VALID [2022-04-07 14:31:05,872 INFO L290 TraceCheckUtils]: 56: Hoare triple {6981#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6981#true} is VALID [2022-04-07 14:31:05,872 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-07 14:31:05,872 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-07 14:31:05,872 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6981#true} {6981#true} #86#return; {6981#true} is VALID [2022-04-07 14:31:05,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:31:05,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:31:05,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:31:05,873 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-07 14:31:05,873 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6981#true} {6981#true} #84#return; {6981#true} is VALID [2022-04-07 14:31:05,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:31:05,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:31:05,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:31:05,873 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-07 14:31:05,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {6981#true} assume !!(#t~post6 < 20);havoc #t~post6; {6981#true} is VALID [2022-04-07 14:31:05,873 INFO L290 TraceCheckUtils]: 42: Hoare triple {6981#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6981#true} is VALID [2022-04-07 14:31:05,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {6981#true} assume !(~r~0 >= ~d~0); {6981#true} is VALID [2022-04-07 14:31:05,873 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6981#true} {6981#true} #82#return; {6981#true} is VALID [2022-04-07 14:31:05,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:31:05,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:31:05,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:31:05,873 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-07 14:31:05,873 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6981#true} {6981#true} #80#return; {6981#true} is VALID [2022-04-07 14:31:05,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:31:05,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:31:05,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:31:05,874 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-07 14:31:05,874 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6981#true} {6981#true} #78#return; {6981#true} is VALID [2022-04-07 14:31:05,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:31:05,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:31:05,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:31:05,874 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-07 14:31:05,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {6981#true} assume !!(#t~post5 < 20);havoc #t~post5; {6981#true} is VALID [2022-04-07 14:31:05,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {6981#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6981#true} is VALID [2022-04-07 14:31:05,874 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-07 14:31:05,874 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6981#true} {6981#true} #82#return; {6981#true} is VALID [2022-04-07 14:31:05,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:31:05,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:31:05,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:31:05,874 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-07 14:31:05,875 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6981#true} {6981#true} #80#return; {6981#true} is VALID [2022-04-07 14:31:05,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:31:05,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:31:05,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:31:05,875 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-07 14:31:05,875 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6981#true} {6981#true} #78#return; {6981#true} is VALID [2022-04-07 14:31:05,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:31:05,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-07 14:31:05,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-07 14:31:05,875 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-07 14:31:05,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {6981#true} assume !!(#t~post5 < 20);havoc #t~post5; {6981#true} is VALID [2022-04-07 14:31:05,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {6981#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6981#true} is VALID [2022-04-07 14:31:05,875 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-07 14:31:05,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {6981#true} call #t~ret7 := main(); {6981#true} is VALID [2022-04-07 14:31:05,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6981#true} {6981#true} #92#return; {6981#true} is VALID [2022-04-07 14:31:05,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-07 14:31:05,876 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-07 14:31:05,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {6981#true} call ULTIMATE.init(); {6981#true} is VALID [2022-04-07 14:31:05,876 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-07 14:31:05,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:31:05,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937780393] [2022-04-07 14:31:05,876 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:31:05,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106328919] [2022-04-07 14:31:05,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106328919] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:31:05,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:31:05,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-07 14:31:05,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210424055] [2022-04-07 14:31:05,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:31:05,877 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-07 14:31:05,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:31:05,878 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-07 14:31:05,933 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-07 14:31:05,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 14:31:05,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:31:05,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 14:31:05,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-07 14:31:05,934 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-07 14:31:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:31:07,082 INFO L93 Difference]: Finished difference Result 335 states and 416 transitions. [2022-04-07 14:31:07,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 14:31:07,082 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-07 14:31:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:31:07,082 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-07 14:31:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-07 14:31:07,087 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-07 14:31:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-07 14:31:07,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 126 transitions. [2022-04-07 14:31:07,207 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-07 14:31:07,212 INFO L225 Difference]: With dead ends: 335 [2022-04-07 14:31:07,212 INFO L226 Difference]: Without dead ends: 239 [2022-04-07 14:31:07,213 INFO L912 BasicCegarLoop]: 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-07 14:31:07,213 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 53 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-07 14:31:07,214 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 167 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 14:31:07,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-07 14:31:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 223. [2022-04-07 14:31:07,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:31:07,304 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-07 14:31:07,304 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-07 14:31:07,304 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-07 14:31:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:31:07,308 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2022-04-07 14:31:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-04-07 14:31:07,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:31:07,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:31:07,309 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-07 14:31:07,310 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-07 14:31:07,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:31:07,314 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2022-04-07 14:31:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-04-07 14:31:07,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:31:07,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:31:07,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:31:07,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:31:07,315 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-07 14:31:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2022-04-07 14:31:07,318 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 73 [2022-04-07 14:31:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:31:07,319 INFO L478 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2022-04-07 14:31:07,319 INFO L479 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-07 14:31:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2022-04-07 14:31:07,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-07 14:31:07,319 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:31:07,319 INFO L499 BasicCegarLoop]: 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-07 14:31:07,336 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-07 14:31:07,536 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-07 14:31:07,536 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:31:07,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:31:07,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1894150768, now seen corresponding path program 1 times [2022-04-07 14:31:07,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:31:07,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722652915] [2022-04-07 14:31:07,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:31:07,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:31:07,549 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:31:07,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2051417173] [2022-04-07 14:31:07,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:31:07,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:31:07,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:31:07,551 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-07 14:31:07,552 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-07 14:31:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:31:07,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-07 14:31:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:31:07,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:31:09,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {8676#true} call ULTIMATE.init(); {8676#true} is VALID [2022-04-07 14:31:09,038 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-07 14:31:09,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-07 14:31:09,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8676#true} {8676#true} #92#return; {8676#true} is VALID [2022-04-07 14:31:09,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {8676#true} call #t~ret7 := main(); {8676#true} is VALID [2022-04-07 14:31:09,039 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-07 14:31:09,039 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-07 14:31:09,039 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-07 14:31:09,039 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-07 14:31:09,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-07 14:31:09,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-07 14:31:09,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-07 14:31:09,040 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8676#true} {8696#(<= 1 main_~p~0)} #78#return; {8696#(<= 1 main_~p~0)} is VALID [2022-04-07 14:31:09,040 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-07 14:31:09,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-07 14:31:09,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-07 14:31:09,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-07 14:31:09,041 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8676#true} {8696#(<= 1 main_~p~0)} #80#return; {8696#(<= 1 main_~p~0)} is VALID [2022-04-07 14:31:09,041 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-07 14:31:09,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-07 14:31:09,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-07 14:31:09,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-07 14:31:09,041 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8676#true} {8696#(<= 1 main_~p~0)} #82#return; {8696#(<= 1 main_~p~0)} is VALID [2022-04-07 14:31:09,042 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-07 14:31:09,042 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-07 14:31:09,043 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-07 14:31:09,043 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-07 14:31:09,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-07 14:31:09,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-07 14:31:09,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-07 14:31:09,043 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-07 14:31:09,044 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-07 14:31:09,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-07 14:31:09,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-07 14:31:09,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-07 14:31:09,044 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-07 14:31:09,044 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-07 14:31:09,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-07 14:31:09,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-07 14:31:09,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-07 14:31:09,045 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-07 14:31:09,046 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-07 14:31:09,046 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-07 14:31:09,046 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-07 14:31:09,046 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-07 14:31:09,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-07 14:31:09,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-07 14:31:09,046 INFO L290 TraceCheckUtils]: 47: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-07 14:31:09,047 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-07 14:31:09,047 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-07 14:31:09,047 INFO L290 TraceCheckUtils]: 50: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-07 14:31:09,047 INFO L290 TraceCheckUtils]: 51: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-07 14:31:09,047 INFO L290 TraceCheckUtils]: 52: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-07 14:31:09,048 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-07 14:31:09,048 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-07 14:31:09,048 INFO L290 TraceCheckUtils]: 55: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-07 14:31:09,048 INFO L290 TraceCheckUtils]: 56: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-07 14:31:09,048 INFO L290 TraceCheckUtils]: 57: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-07 14:31:09,048 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-07 14:31:09,049 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-07 14:31:09,049 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-07 14:31:09,049 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-07 14:31:09,049 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-07 14:31:09,049 INFO L290 TraceCheckUtils]: 63: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-07 14:31:09,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-07 14:31:09,050 INFO L290 TraceCheckUtils]: 65: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-07 14:31:09,050 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-07 14:31:09,050 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-07 14:31:09,050 INFO L290 TraceCheckUtils]: 68: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-07 14:31:09,050 INFO L290 TraceCheckUtils]: 69: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-07 14:31:09,050 INFO L290 TraceCheckUtils]: 70: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-07 14:31:09,051 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-07 14:31:09,051 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-07 14:31:09,051 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-07 14:31:09,051 INFO L290 TraceCheckUtils]: 74: Hoare triple {8677#false} ~cond := #in~cond; {8677#false} is VALID [2022-04-07 14:31:09,051 INFO L290 TraceCheckUtils]: 75: Hoare triple {8677#false} assume !(0 == ~cond); {8677#false} is VALID [2022-04-07 14:31:09,051 INFO L290 TraceCheckUtils]: 76: Hoare triple {8677#false} assume true; {8677#false} is VALID [2022-04-07 14:31:09,051 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8677#false} {8677#false} #88#return; {8677#false} is VALID [2022-04-07 14:31:09,051 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-07 14:31:09,051 INFO L290 TraceCheckUtils]: 79: Hoare triple {8677#false} ~cond := #in~cond; {8677#false} is VALID [2022-04-07 14:31:09,052 INFO L290 TraceCheckUtils]: 80: Hoare triple {8677#false} assume 0 == ~cond; {8677#false} is VALID [2022-04-07 14:31:09,052 INFO L290 TraceCheckUtils]: 81: Hoare triple {8677#false} assume !false; {8677#false} is VALID [2022-04-07 14:31:09,052 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-07 14:31:09,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:31:09,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:31:09,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722652915] [2022-04-07 14:31:09,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:31:09,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051417173] [2022-04-07 14:31:09,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051417173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:31:09,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:31:09,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 14:31:09,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315889122] [2022-04-07 14:31:09,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:31:09,053 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-07 14:31:09,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:31:09,053 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-07 14:31:09,094 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-07 14:31:09,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:31:09,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:31:09,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:31:09,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:31:09,095 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-07 14:31:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:31:09,320 INFO L93 Difference]: Finished difference Result 242 states and 289 transitions. [2022-04-07 14:31:09,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:31:09,320 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-07 14:31:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:31:09,320 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-07 14:31:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-04-07 14:31:09,321 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-07 14:31:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-04-07 14:31:09,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 88 transitions. [2022-04-07 14:31:09,388 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-07 14:31:09,392 INFO L225 Difference]: With dead ends: 242 [2022-04-07 14:31:09,392 INFO L226 Difference]: Without dead ends: 222 [2022-04-07 14:31:09,392 INFO L912 BasicCegarLoop]: 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-07 14:31:09,393 INFO L913 BasicCegarLoop]: 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-07 14:31:09,393 INFO L914 BasicCegarLoop]: 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-07 14:31:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-07 14:31:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2022-04-07 14:31:09,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:31:09,478 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-07 14:31:09,479 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-07 14:31:09,480 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-07 14:31:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:31:09,484 INFO L93 Difference]: Finished difference Result 222 states and 263 transitions. [2022-04-07 14:31:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2022-04-07 14:31:09,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:31:09,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:31:09,485 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-07 14:31:09,486 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-07 14:31:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:31:09,492 INFO L93 Difference]: Finished difference Result 222 states and 263 transitions. [2022-04-07 14:31:09,492 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2022-04-07 14:31:09,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:31:09,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:31:09,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:31:09,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:31:09,493 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-07 14:31:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 255 transitions. [2022-04-07 14:31:09,500 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 255 transitions. Word has length 82 [2022-04-07 14:31:09,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:31:09,501 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 255 transitions. [2022-04-07 14:31:09,501 INFO L479 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-07 14:31:09,501 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 255 transitions. [2022-04-07 14:31:09,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-07 14:31:09,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:31:09,502 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:31:09,541 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-07 14:31:09,719 WARN L460 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-07 14:31:09,719 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:31:09,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:31:09,720 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 2 times [2022-04-07 14:31:09,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:31:09,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077019226] [2022-04-07 14:31:09,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:31:09,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:31:09,729 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:31:09,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1467217659] [2022-04-07 14:31:09,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 14:31:09,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:31:09,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:31:09,731 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-07 14:31:09,741 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-07 14:31:09,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 14:31:09,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:31:09,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-07 14:31:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:31:09,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:31:10,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {9994#true} call ULTIMATE.init(); {9994#true} is VALID [2022-04-07 14:31:10,503 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-07 14:31:10,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9994#true} {9994#true} #92#return; {9994#true} is VALID [2022-04-07 14:31:10,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {9994#true} call #t~ret7 := main(); {9994#true} is VALID [2022-04-07 14:31:10,503 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-07 14:31:10,504 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-07 14:31:10,504 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-07 14:31:10,504 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-07 14:31:10,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:10,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:10,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,505 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-07 14:31:10,505 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-07 14:31:10,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:10,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:10,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,508 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-07 14:31:10,508 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-07 14:31:10,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:10,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:10,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,512 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-07 14:31:10,512 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-07 14:31:10,513 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-07 14:31:10,513 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-07 14:31:10,513 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-07 14:31:10,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:10,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:10,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,514 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-07 14:31:10,514 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-07 14:31:10,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:10,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:10,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,515 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-07 14:31:10,515 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-07 14:31:10,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:10,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:10,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,515 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-07 14:31:10,516 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-07 14:31:10,516 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-07 14:31:10,516 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-07 14:31:10,517 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-07 14:31:10,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:10,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:10,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,517 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-07 14:31:10,517 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-07 14:31:10,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:10,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:10,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,518 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-07 14:31:10,518 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-07 14:31:10,518 INFO L290 TraceCheckUtils]: 55: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:10,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:10,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,519 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-07 14:31:10,519 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-07 14:31:10,519 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-07 14:31:10,520 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-07 14:31:10,520 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-07 14:31:10,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:10,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:10,520 INFO L290 TraceCheckUtils]: 65: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,521 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-07 14:31:10,521 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-07 14:31:10,521 INFO L290 TraceCheckUtils]: 68: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:10,521 INFO L290 TraceCheckUtils]: 69: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:10,521 INFO L290 TraceCheckUtils]: 70: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,530 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-07 14:31:10,530 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-07 14:31:10,531 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-07 14:31:10,531 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-07 14:31:10,532 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-07 14:31:10,532 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-07 14:31:10,532 INFO L290 TraceCheckUtils]: 77: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:10,532 INFO L290 TraceCheckUtils]: 78: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:10,532 INFO L290 TraceCheckUtils]: 79: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,532 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-07 14:31:10,533 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-07 14:31:10,533 INFO L290 TraceCheckUtils]: 82: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:10,533 INFO L290 TraceCheckUtils]: 83: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:10,533 INFO L290 TraceCheckUtils]: 84: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:10,533 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-07 14:31:10,534 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-07 14:31:10,535 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-07 14:31:10,535 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-07 14:31:10,535 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-07 14:31:10,536 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-07 14:31:10,536 INFO L290 TraceCheckUtils]: 91: Hoare triple {10275#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10279#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:31:10,537 INFO L290 TraceCheckUtils]: 92: Hoare triple {10279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9995#false} is VALID [2022-04-07 14:31:10,537 INFO L290 TraceCheckUtils]: 93: Hoare triple {9995#false} assume !false; {9995#false} is VALID [2022-04-07 14:31:10,537 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-07 14:31:10,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:31:28,372 INFO L290 TraceCheckUtils]: 93: Hoare triple {9995#false} assume !false; {9995#false} is VALID [2022-04-07 14:31:28,372 INFO L290 TraceCheckUtils]: 92: Hoare triple {10279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9995#false} is VALID [2022-04-07 14:31:28,373 INFO L290 TraceCheckUtils]: 91: Hoare triple {10275#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10279#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:31:28,373 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-07 14:31:28,373 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-07 14:31:28,374 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-07 14:31:28,385 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-07 14:31:28,405 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-07 14:31:28,406 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-07 14:31:28,406 INFO L290 TraceCheckUtils]: 84: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,406 INFO L290 TraceCheckUtils]: 83: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:28,406 INFO L290 TraceCheckUtils]: 82: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:28,406 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-07 14:31:28,407 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-07 14:31:28,407 INFO L290 TraceCheckUtils]: 79: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,407 INFO L290 TraceCheckUtils]: 78: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:28,407 INFO L290 TraceCheckUtils]: 77: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:28,407 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-07 14:31:28,408 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-07 14:31:28,409 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-07 14:31:28,436 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-07 14:31:28,750 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-07 14:31:28,752 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-07 14:31:28,752 INFO L290 TraceCheckUtils]: 70: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,752 INFO L290 TraceCheckUtils]: 69: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:28,752 INFO L290 TraceCheckUtils]: 68: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:28,752 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-07 14:31:28,753 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-07 14:31:28,753 INFO L290 TraceCheckUtils]: 65: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,753 INFO L290 TraceCheckUtils]: 64: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:28,753 INFO L290 TraceCheckUtils]: 63: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:28,753 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-07 14:31:28,757 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-07 14:31:28,760 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-07 14:31:28,763 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-07 14:31:28,764 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-07 14:31:28,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:28,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:28,764 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-07 14:31:28,765 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-07 14:31:28,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,765 INFO L290 TraceCheckUtils]: 51: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:28,765 INFO L290 TraceCheckUtils]: 50: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:28,765 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-07 14:31:28,766 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-07 14:31:28,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:28,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:28,767 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-07 14:31:28,769 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-07 14:31:28,773 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-07 14:31:28,955 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-07 14:31:28,956 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-07 14:31:28,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:28,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:28,956 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-07 14:31:28,957 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-07 14:31:28,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:28,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:28,957 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-07 14:31:28,958 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-07 14:31:28,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:28,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:28,958 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-07 14:31:28,959 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-07 14:31:28,960 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-07 14:31:28,987 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-07 14:31:28,988 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-07 14:31:28,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:28,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:28,988 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-07 14:31:28,988 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-07 14:31:28,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:28,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:28,989 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-07 14:31:28,990 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-07 14:31:28,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-07 14:31:28,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-07 14:31:28,990 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-07 14:31:28,990 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-07 14:31:28,991 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-07 14:31:28,991 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-07 14:31:28,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {9994#true} call #t~ret7 := main(); {9994#true} is VALID [2022-04-07 14:31:28,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9994#true} {9994#true} #92#return; {9994#true} is VALID [2022-04-07 14:31:28,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-07 14:31:28,991 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-07 14:31:28,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {9994#true} call ULTIMATE.init(); {9994#true} is VALID [2022-04-07 14:31:28,993 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-07 14:31:28,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:31:28,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077019226] [2022-04-07 14:31:28,993 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:31:28,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467217659] [2022-04-07 14:31:28,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467217659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:31:28,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:31:28,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-07 14:31:28,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656845688] [2022-04-07 14:31:28,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:31:28,994 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-07 14:31:28,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:31:28,994 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-07 14:31:29,657 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-07 14:31:29,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 14:31:29,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:31:29,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 14:31:29,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-07 14:31:29,658 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-07 14:32:01,753 WARN L232 SmtUtils]: Spent 30.74s 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-07 14:32:05,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 14:32:20,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 14:32:22,562 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-07 14:32:31,424 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-07 14:32:35,799 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-07 14:32:41,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 14:32:43,312 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-07 14:32:46,415 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-07 14:32:48,420 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-07 14:32:51,215 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-07 14:33:01,462 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-07 14:33:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:02,643 INFO L93 Difference]: Finished difference Result 332 states and 434 transitions. [2022-04-07 14:33:02,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 14:33:02,644 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-07 14:33:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:33:02,644 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-07 14:33:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 204 transitions. [2022-04-07 14:33:02,647 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-07 14:33:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 204 transitions. [2022-04-07 14:33:02,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 204 transitions. [2022-04-07 14:33:03,564 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-07 14:33:03,569 INFO L225 Difference]: With dead ends: 332 [2022-04-07 14:33:03,569 INFO L226 Difference]: Without dead ends: 275 [2022-04-07 14:33:03,570 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-04-07 14:33:03,570 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 126 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 187 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:33:03,570 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 368 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 769 Invalid, 8 Unknown, 0 Unchecked, 30.0s Time] [2022-04-07 14:33:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-07 14:33:03,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 257. [2022-04-07 14:33:03,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:33:03,695 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-07 14:33:03,695 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-07 14:33:03,696 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-07 14:33:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:03,702 INFO L93 Difference]: Finished difference Result 275 states and 354 transitions. [2022-04-07 14:33:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2022-04-07 14:33:03,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:33:03,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:33:03,703 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-07 14:33:03,703 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-07 14:33:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:03,711 INFO L93 Difference]: Finished difference Result 275 states and 354 transitions. [2022-04-07 14:33:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2022-04-07 14:33:03,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:33:03,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:33:03,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:33:03,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:33:03,713 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-07 14:33:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 323 transitions. [2022-04-07 14:33:03,720 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 323 transitions. Word has length 94 [2022-04-07 14:33:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:33:03,721 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 323 transitions. [2022-04-07 14:33:03,721 INFO L479 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-07 14:33:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 323 transitions. [2022-04-07 14:33:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-07 14:33:03,722 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:33:03,722 INFO L499 BasicCegarLoop]: 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-07 14:33:03,756 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-07 14:33:03,942 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-07 14:33:03,942 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:33:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:33:03,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1539828763, now seen corresponding path program 1 times [2022-04-07 14:33:03,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:33:03,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975805135] [2022-04-07 14:33:03,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:33:03,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:33:03,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:33:03,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208964918] [2022-04-07 14:33:03,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:33:03,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:33:03,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:33:03,964 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-07 14:33:03,965 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-07 14:33:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:33:04,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 14:33:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:33:04,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:33:04,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {11941#true} call ULTIMATE.init(); {11941#true} is VALID [2022-04-07 14:33:04,411 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-07 14:33:04,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {11949#(<= ~counter~0 0)} assume true; {11949#(<= ~counter~0 0)} is VALID [2022-04-07 14:33:04,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11949#(<= ~counter~0 0)} {11941#true} #92#return; {11949#(<= ~counter~0 0)} is VALID [2022-04-07 14:33:04,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {11949#(<= ~counter~0 0)} call #t~ret7 := main(); {11949#(<= ~counter~0 0)} is VALID [2022-04-07 14:33:04,412 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-07 14:33:04,413 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-07 14:33:04,413 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-07 14:33:04,414 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-07 14:33:04,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {11965#(<= ~counter~0 1)} ~cond := #in~cond; {11965#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:04,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {11965#(<= ~counter~0 1)} assume !(0 == ~cond); {11965#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:04,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {11965#(<= ~counter~0 1)} assume true; {11965#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:04,415 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11965#(<= ~counter~0 1)} {11965#(<= ~counter~0 1)} #78#return; {11965#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:04,415 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-07 14:33:04,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {11965#(<= ~counter~0 1)} ~cond := #in~cond; {11965#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:04,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {11965#(<= ~counter~0 1)} assume !(0 == ~cond); {11965#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:04,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {11965#(<= ~counter~0 1)} assume true; {11965#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:04,417 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11965#(<= ~counter~0 1)} {11965#(<= ~counter~0 1)} #80#return; {11965#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:04,417 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-07 14:33:04,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {11965#(<= ~counter~0 1)} ~cond := #in~cond; {11965#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:04,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {11965#(<= ~counter~0 1)} assume !(0 == ~cond); {11965#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:04,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {11965#(<= ~counter~0 1)} assume true; {11965#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:04,419 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11965#(<= ~counter~0 1)} {11965#(<= ~counter~0 1)} #82#return; {11965#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:04,419 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-07 14:33:04,419 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-07 14:33:04,420 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-07 14:33:04,420 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-07 14:33:04,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {12020#(<= ~counter~0 2)} ~cond := #in~cond; {12020#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:04,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {12020#(<= ~counter~0 2)} assume !(0 == ~cond); {12020#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:04,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {12020#(<= ~counter~0 2)} assume true; {12020#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:04,421 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12020#(<= ~counter~0 2)} {12020#(<= ~counter~0 2)} #78#return; {12020#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:04,421 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-07 14:33:04,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {12020#(<= ~counter~0 2)} ~cond := #in~cond; {12020#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:04,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {12020#(<= ~counter~0 2)} assume !(0 == ~cond); {12020#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:04,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {12020#(<= ~counter~0 2)} assume true; {12020#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:04,423 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12020#(<= ~counter~0 2)} {12020#(<= ~counter~0 2)} #80#return; {12020#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:04,423 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-07 14:33:04,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {12020#(<= ~counter~0 2)} ~cond := #in~cond; {12020#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:04,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {12020#(<= ~counter~0 2)} assume !(0 == ~cond); {12020#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:04,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {12020#(<= ~counter~0 2)} assume true; {12020#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:04,424 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12020#(<= ~counter~0 2)} {12020#(<= ~counter~0 2)} #82#return; {12020#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:04,425 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-07 14:33:04,425 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-07 14:33:04,425 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-07 14:33:04,426 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-07 14:33:04,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {12075#(<= ~counter~0 3)} ~cond := #in~cond; {12075#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:04,426 INFO L290 TraceCheckUtils]: 46: Hoare triple {12075#(<= ~counter~0 3)} assume !(0 == ~cond); {12075#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:04,426 INFO L290 TraceCheckUtils]: 47: Hoare triple {12075#(<= ~counter~0 3)} assume true; {12075#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:04,427 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12075#(<= ~counter~0 3)} {12075#(<= ~counter~0 3)} #78#return; {12075#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:04,427 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-07 14:33:04,428 INFO L290 TraceCheckUtils]: 50: Hoare triple {12075#(<= ~counter~0 3)} ~cond := #in~cond; {12075#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:04,428 INFO L290 TraceCheckUtils]: 51: Hoare triple {12075#(<= ~counter~0 3)} assume !(0 == ~cond); {12075#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:04,428 INFO L290 TraceCheckUtils]: 52: Hoare triple {12075#(<= ~counter~0 3)} assume true; {12075#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:04,429 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12075#(<= ~counter~0 3)} {12075#(<= ~counter~0 3)} #80#return; {12075#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:04,429 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-07 14:33:04,429 INFO L290 TraceCheckUtils]: 55: Hoare triple {12075#(<= ~counter~0 3)} ~cond := #in~cond; {12075#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:04,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {12075#(<= ~counter~0 3)} assume !(0 == ~cond); {12075#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:04,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {12075#(<= ~counter~0 3)} assume true; {12075#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:04,431 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12075#(<= ~counter~0 3)} {12075#(<= ~counter~0 3)} #82#return; {12075#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:04,431 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-07 14:33:04,432 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-07 14:33:04,432 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-07 14:33:04,432 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-07 14:33:04,433 INFO L290 TraceCheckUtils]: 63: Hoare triple {12130#(<= ~counter~0 4)} ~cond := #in~cond; {12130#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:04,439 INFO L290 TraceCheckUtils]: 64: Hoare triple {12130#(<= ~counter~0 4)} assume !(0 == ~cond); {12130#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:04,439 INFO L290 TraceCheckUtils]: 65: Hoare triple {12130#(<= ~counter~0 4)} assume true; {12130#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:04,440 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12130#(<= ~counter~0 4)} {12130#(<= ~counter~0 4)} #78#return; {12130#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:04,440 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-07 14:33:04,440 INFO L290 TraceCheckUtils]: 68: Hoare triple {12130#(<= ~counter~0 4)} ~cond := #in~cond; {12130#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:04,440 INFO L290 TraceCheckUtils]: 69: Hoare triple {12130#(<= ~counter~0 4)} assume !(0 == ~cond); {12130#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:04,441 INFO L290 TraceCheckUtils]: 70: Hoare triple {12130#(<= ~counter~0 4)} assume true; {12130#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:04,441 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12130#(<= ~counter~0 4)} {12130#(<= ~counter~0 4)} #80#return; {12130#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:04,441 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-07 14:33:04,442 INFO L290 TraceCheckUtils]: 73: Hoare triple {12130#(<= ~counter~0 4)} ~cond := #in~cond; {12130#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:04,442 INFO L290 TraceCheckUtils]: 74: Hoare triple {12130#(<= ~counter~0 4)} assume !(0 == ~cond); {12130#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:04,442 INFO L290 TraceCheckUtils]: 75: Hoare triple {12130#(<= ~counter~0 4)} assume true; {12130#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:04,442 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12130#(<= ~counter~0 4)} {12130#(<= ~counter~0 4)} #82#return; {12130#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:04,443 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-07 14:33:04,443 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-07 14:33:04,443 INFO L290 TraceCheckUtils]: 79: Hoare triple {12185#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {11942#false} is VALID [2022-04-07 14:33:04,443 INFO L290 TraceCheckUtils]: 80: Hoare triple {11942#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11942#false} is VALID [2022-04-07 14:33:04,443 INFO L290 TraceCheckUtils]: 81: Hoare triple {11942#false} assume !!(#t~post6 < 20);havoc #t~post6; {11942#false} is VALID [2022-04-07 14:33:04,443 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-07 14:33:04,443 INFO L290 TraceCheckUtils]: 83: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-07 14:33:04,444 INFO L290 TraceCheckUtils]: 84: Hoare triple {11942#false} assume !(0 == ~cond); {11942#false} is VALID [2022-04-07 14:33:04,444 INFO L290 TraceCheckUtils]: 85: Hoare triple {11942#false} assume true; {11942#false} is VALID [2022-04-07 14:33:04,444 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {11942#false} {11942#false} #84#return; {11942#false} is VALID [2022-04-07 14:33:04,444 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-07 14:33:04,444 INFO L290 TraceCheckUtils]: 88: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-07 14:33:04,444 INFO L290 TraceCheckUtils]: 89: Hoare triple {11942#false} assume !(0 == ~cond); {11942#false} is VALID [2022-04-07 14:33:04,444 INFO L290 TraceCheckUtils]: 90: Hoare triple {11942#false} assume true; {11942#false} is VALID [2022-04-07 14:33:04,444 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11942#false} {11942#false} #86#return; {11942#false} is VALID [2022-04-07 14:33:04,444 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-07 14:33:04,444 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-07 14:33:04,444 INFO L290 TraceCheckUtils]: 94: Hoare triple {11942#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11942#false} is VALID [2022-04-07 14:33:04,444 INFO L290 TraceCheckUtils]: 95: Hoare triple {11942#false} assume !(#t~post6 < 20);havoc #t~post6; {11942#false} is VALID [2022-04-07 14:33:04,444 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-07 14:33:04,444 INFO L290 TraceCheckUtils]: 97: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-07 14:33:04,444 INFO L290 TraceCheckUtils]: 98: Hoare triple {11942#false} assume 0 == ~cond; {11942#false} is VALID [2022-04-07 14:33:04,444 INFO L290 TraceCheckUtils]: 99: Hoare triple {11942#false} assume !false; {11942#false} is VALID [2022-04-07 14:33:04,445 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-07 14:33:04,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:33:04,808 INFO L290 TraceCheckUtils]: 99: Hoare triple {11942#false} assume !false; {11942#false} is VALID [2022-04-07 14:33:04,808 INFO L290 TraceCheckUtils]: 98: Hoare triple {11942#false} assume 0 == ~cond; {11942#false} is VALID [2022-04-07 14:33:04,808 INFO L290 TraceCheckUtils]: 97: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-07 14:33:04,808 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-07 14:33:04,808 INFO L290 TraceCheckUtils]: 95: Hoare triple {11942#false} assume !(#t~post6 < 20);havoc #t~post6; {11942#false} is VALID [2022-04-07 14:33:04,808 INFO L290 TraceCheckUtils]: 94: Hoare triple {11942#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11942#false} is VALID [2022-04-07 14:33:04,808 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-07 14:33:04,808 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-07 14:33:04,809 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11941#true} {11942#false} #86#return; {11942#false} is VALID [2022-04-07 14:33:04,809 INFO L290 TraceCheckUtils]: 90: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,809 INFO L290 TraceCheckUtils]: 89: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,809 INFO L290 TraceCheckUtils]: 88: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,809 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-07 14:33:04,809 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {11941#true} {11942#false} #84#return; {11942#false} is VALID [2022-04-07 14:33:04,809 INFO L290 TraceCheckUtils]: 85: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,809 INFO L290 TraceCheckUtils]: 84: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,809 INFO L290 TraceCheckUtils]: 83: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,809 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-07 14:33:04,809 INFO L290 TraceCheckUtils]: 81: Hoare triple {11942#false} assume !!(#t~post6 < 20);havoc #t~post6; {11942#false} is VALID [2022-04-07 14:33:04,809 INFO L290 TraceCheckUtils]: 80: Hoare triple {11942#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11942#false} is VALID [2022-04-07 14:33:04,809 INFO L290 TraceCheckUtils]: 79: Hoare triple {12309#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {11942#false} is VALID [2022-04-07 14:33:04,810 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-07 14:33:04,810 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-07 14:33:04,811 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {11941#true} {12313#(< ~counter~0 20)} #82#return; {12313#(< ~counter~0 20)} is VALID [2022-04-07 14:33:04,811 INFO L290 TraceCheckUtils]: 75: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,811 INFO L290 TraceCheckUtils]: 74: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,811 INFO L290 TraceCheckUtils]: 73: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,811 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-07 14:33:04,811 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11941#true} {12313#(< ~counter~0 20)} #80#return; {12313#(< ~counter~0 20)} is VALID [2022-04-07 14:33:04,811 INFO L290 TraceCheckUtils]: 70: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,811 INFO L290 TraceCheckUtils]: 69: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,811 INFO L290 TraceCheckUtils]: 68: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,812 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-07 14:33:04,812 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11941#true} {12313#(< ~counter~0 20)} #78#return; {12313#(< ~counter~0 20)} is VALID [2022-04-07 14:33:04,812 INFO L290 TraceCheckUtils]: 65: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,812 INFO L290 TraceCheckUtils]: 64: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,812 INFO L290 TraceCheckUtils]: 63: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,812 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-07 14:33:04,812 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-07 14:33:04,813 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-07 14:33:04,813 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-07 14:33:04,814 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11941#true} {12368#(< ~counter~0 19)} #82#return; {12368#(< ~counter~0 19)} is VALID [2022-04-07 14:33:04,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,814 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-07 14:33:04,814 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {11941#true} {12368#(< ~counter~0 19)} #80#return; {12368#(< ~counter~0 19)} is VALID [2022-04-07 14:33:04,814 INFO L290 TraceCheckUtils]: 52: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,815 INFO L290 TraceCheckUtils]: 51: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,815 INFO L290 TraceCheckUtils]: 50: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,815 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-07 14:33:04,815 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {11941#true} {12368#(< ~counter~0 19)} #78#return; {12368#(< ~counter~0 19)} is VALID [2022-04-07 14:33:04,815 INFO L290 TraceCheckUtils]: 47: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,815 INFO L290 TraceCheckUtils]: 46: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,815 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-07 14:33:04,815 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-07 14:33:04,816 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-07 14:33:04,816 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-07 14:33:04,817 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11941#true} {12423#(< ~counter~0 18)} #82#return; {12423#(< ~counter~0 18)} is VALID [2022-04-07 14:33:04,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,817 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-07 14:33:04,817 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {11941#true} {12423#(< ~counter~0 18)} #80#return; {12423#(< ~counter~0 18)} is VALID [2022-04-07 14:33:04,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,818 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-07 14:33:04,818 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {11941#true} {12423#(< ~counter~0 18)} #78#return; {12423#(< ~counter~0 18)} is VALID [2022-04-07 14:33:04,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,818 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-07 14:33:04,818 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-07 14:33:04,819 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-07 14:33:04,819 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-07 14:33:04,820 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11941#true} {12478#(< ~counter~0 17)} #82#return; {12478#(< ~counter~0 17)} is VALID [2022-04-07 14:33:04,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,820 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-07 14:33:04,821 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11941#true} {12478#(< ~counter~0 17)} #80#return; {12478#(< ~counter~0 17)} is VALID [2022-04-07 14:33:04,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,821 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-07 14:33:04,821 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11941#true} {12478#(< ~counter~0 17)} #78#return; {12478#(< ~counter~0 17)} is VALID [2022-04-07 14:33:04,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-07 14:33:04,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-07 14:33:04,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-07 14:33:04,822 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-07 14:33:04,822 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-07 14:33:04,822 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-07 14:33:04,823 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-07 14:33:04,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {12533#(< ~counter~0 16)} call #t~ret7 := main(); {12533#(< ~counter~0 16)} is VALID [2022-04-07 14:33:04,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12533#(< ~counter~0 16)} {11941#true} #92#return; {12533#(< ~counter~0 16)} is VALID [2022-04-07 14:33:04,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {12533#(< ~counter~0 16)} assume true; {12533#(< ~counter~0 16)} is VALID [2022-04-07 14:33:04,824 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-07 14:33:04,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {11941#true} call ULTIMATE.init(); {11941#true} is VALID [2022-04-07 14:33:04,824 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-07 14:33:04,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:33:04,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975805135] [2022-04-07 14:33:04,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:33:04,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208964918] [2022-04-07 14:33:04,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208964918] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:33:04,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:33:04,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-07 14:33:04,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448630635] [2022-04-07 14:33:04,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:33:04,826 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-07 14:33:04,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:33:04,826 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-07 14:33:04,911 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-07 14:33:04,912 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 14:33:04,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:33:04,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 14:33:04,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-07 14:33:04,912 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-07 14:33:06,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:06,078 INFO L93 Difference]: Finished difference Result 746 states and 1016 transitions. [2022-04-07 14:33:06,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-07 14:33:06,078 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-07 14:33:06,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:33:06,079 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-07 14:33:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 260 transitions. [2022-04-07 14:33:06,082 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-07 14:33:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 260 transitions. [2022-04-07 14:33:06,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 260 transitions. [2022-04-07 14:33:06,276 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-07 14:33:06,294 INFO L225 Difference]: With dead ends: 746 [2022-04-07 14:33:06,294 INFO L226 Difference]: Without dead ends: 659 [2022-04-07 14:33:06,296 INFO L912 BasicCegarLoop]: 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-07 14:33:06,297 INFO L913 BasicCegarLoop]: 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-07 14:33:06,297 INFO L914 BasicCegarLoop]: 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-07 14:33:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-04-07 14:33:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 552. [2022-04-07 14:33:06,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:33:06,583 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-07 14:33:06,583 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-07 14:33:06,584 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-07 14:33:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:06,601 INFO L93 Difference]: Finished difference Result 659 states and 886 transitions. [2022-04-07 14:33:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 886 transitions. [2022-04-07 14:33:06,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:33:06,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:33:06,604 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-07 14:33:06,604 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-07 14:33:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:06,623 INFO L93 Difference]: Finished difference Result 659 states and 886 transitions. [2022-04-07 14:33:06,623 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 886 transitions. [2022-04-07 14:33:06,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:33:06,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:33:06,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:33:06,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:33:06,627 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-07 14:33:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 730 transitions. [2022-04-07 14:33:06,644 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 730 transitions. Word has length 100 [2022-04-07 14:33:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:33:06,644 INFO L478 AbstractCegarLoop]: Abstraction has 552 states and 730 transitions. [2022-04-07 14:33:06,644 INFO L479 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-07 14:33:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 730 transitions. [2022-04-07 14:33:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-07 14:33:06,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:33:06,647 INFO L499 BasicCegarLoop]: 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-07 14:33:06,667 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-07 14:33:06,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-07 14:33:06,851 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:33:06,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:33:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 1 times [2022-04-07 14:33:06,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:33:06,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630463951] [2022-04-07 14:33:06,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:33:06,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:33:06,864 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:33:06,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2022673158] [2022-04-07 14:33:06,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:33:06,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:33:06,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:33:06,865 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-07 14:33:06,865 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-07 14:33:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:33:06,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 14:33:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:33:06,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:33:07,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {15651#true} call ULTIMATE.init(); {15651#true} is VALID [2022-04-07 14:33:07,356 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-07 14:33:07,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {15659#(<= ~counter~0 0)} assume true; {15659#(<= ~counter~0 0)} is VALID [2022-04-07 14:33:07,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15659#(<= ~counter~0 0)} {15651#true} #92#return; {15659#(<= ~counter~0 0)} is VALID [2022-04-07 14:33:07,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {15659#(<= ~counter~0 0)} call #t~ret7 := main(); {15659#(<= ~counter~0 0)} is VALID [2022-04-07 14:33:07,357 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-07 14:33:07,358 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-07 14:33:07,358 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-07 14:33:07,359 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-07 14:33:07,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {15675#(<= ~counter~0 1)} ~cond := #in~cond; {15675#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:07,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {15675#(<= ~counter~0 1)} assume !(0 == ~cond); {15675#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:07,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {15675#(<= ~counter~0 1)} assume true; {15675#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:07,360 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15675#(<= ~counter~0 1)} {15675#(<= ~counter~0 1)} #78#return; {15675#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:07,360 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-07 14:33:07,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {15675#(<= ~counter~0 1)} ~cond := #in~cond; {15675#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:07,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {15675#(<= ~counter~0 1)} assume !(0 == ~cond); {15675#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:07,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {15675#(<= ~counter~0 1)} assume true; {15675#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:07,361 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15675#(<= ~counter~0 1)} {15675#(<= ~counter~0 1)} #80#return; {15675#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:07,362 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-07 14:33:07,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {15675#(<= ~counter~0 1)} ~cond := #in~cond; {15675#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:07,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {15675#(<= ~counter~0 1)} assume !(0 == ~cond); {15675#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:07,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {15675#(<= ~counter~0 1)} assume true; {15675#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:07,363 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15675#(<= ~counter~0 1)} {15675#(<= ~counter~0 1)} #82#return; {15675#(<= ~counter~0 1)} is VALID [2022-04-07 14:33:07,363 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-07 14:33:07,363 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-07 14:33:07,364 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-07 14:33:07,364 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-07 14:33:07,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {15730#(<= ~counter~0 2)} ~cond := #in~cond; {15730#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:07,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {15730#(<= ~counter~0 2)} assume !(0 == ~cond); {15730#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:07,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {15730#(<= ~counter~0 2)} assume true; {15730#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:07,365 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15730#(<= ~counter~0 2)} {15730#(<= ~counter~0 2)} #78#return; {15730#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:07,365 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-07 14:33:07,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {15730#(<= ~counter~0 2)} ~cond := #in~cond; {15730#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:07,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {15730#(<= ~counter~0 2)} assume !(0 == ~cond); {15730#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:07,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {15730#(<= ~counter~0 2)} assume true; {15730#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:07,367 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15730#(<= ~counter~0 2)} {15730#(<= ~counter~0 2)} #80#return; {15730#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:07,367 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-07 14:33:07,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {15730#(<= ~counter~0 2)} ~cond := #in~cond; {15730#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:07,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {15730#(<= ~counter~0 2)} assume !(0 == ~cond); {15730#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:07,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {15730#(<= ~counter~0 2)} assume true; {15730#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:07,368 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15730#(<= ~counter~0 2)} {15730#(<= ~counter~0 2)} #82#return; {15730#(<= ~counter~0 2)} is VALID [2022-04-07 14:33:07,368 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-07 14:33:07,369 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-07 14:33:07,369 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-07 14:33:07,369 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-07 14:33:07,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {15785#(<= ~counter~0 3)} ~cond := #in~cond; {15785#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:07,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {15785#(<= ~counter~0 3)} assume !(0 == ~cond); {15785#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:07,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {15785#(<= ~counter~0 3)} assume true; {15785#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:07,371 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15785#(<= ~counter~0 3)} {15785#(<= ~counter~0 3)} #78#return; {15785#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:07,371 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-07 14:33:07,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {15785#(<= ~counter~0 3)} ~cond := #in~cond; {15785#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:07,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {15785#(<= ~counter~0 3)} assume !(0 == ~cond); {15785#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:07,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {15785#(<= ~counter~0 3)} assume true; {15785#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:07,372 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15785#(<= ~counter~0 3)} {15785#(<= ~counter~0 3)} #80#return; {15785#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:07,372 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-07 14:33:07,373 INFO L290 TraceCheckUtils]: 55: Hoare triple {15785#(<= ~counter~0 3)} ~cond := #in~cond; {15785#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:07,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {15785#(<= ~counter~0 3)} assume !(0 == ~cond); {15785#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:07,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {15785#(<= ~counter~0 3)} assume true; {15785#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:07,374 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15785#(<= ~counter~0 3)} {15785#(<= ~counter~0 3)} #82#return; {15785#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:07,374 INFO L290 TraceCheckUtils]: 59: Hoare triple {15785#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {15785#(<= ~counter~0 3)} is VALID [2022-04-07 14:33:07,374 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-07 14:33:07,375 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-07 14:33:07,375 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-07 14:33:07,375 INFO L290 TraceCheckUtils]: 63: Hoare triple {15840#(<= ~counter~0 4)} ~cond := #in~cond; {15840#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:07,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {15840#(<= ~counter~0 4)} assume !(0 == ~cond); {15840#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:07,376 INFO L290 TraceCheckUtils]: 65: Hoare triple {15840#(<= ~counter~0 4)} assume true; {15840#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:07,376 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15840#(<= ~counter~0 4)} {15840#(<= ~counter~0 4)} #84#return; {15840#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:07,377 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-07 14:33:07,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {15840#(<= ~counter~0 4)} ~cond := #in~cond; {15840#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:07,377 INFO L290 TraceCheckUtils]: 69: Hoare triple {15840#(<= ~counter~0 4)} assume !(0 == ~cond); {15840#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:07,377 INFO L290 TraceCheckUtils]: 70: Hoare triple {15840#(<= ~counter~0 4)} assume true; {15840#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:07,378 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15840#(<= ~counter~0 4)} {15840#(<= ~counter~0 4)} #86#return; {15840#(<= ~counter~0 4)} is VALID [2022-04-07 14:33:07,378 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-07 14:33:07,378 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-07 14:33:07,379 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-07 14:33:07,379 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-07 14:33:07,379 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-07 14:33:07,380 INFO L290 TraceCheckUtils]: 77: Hoare triple {15883#(<= ~counter~0 5)} ~cond := #in~cond; {15883#(<= ~counter~0 5)} is VALID [2022-04-07 14:33:07,380 INFO L290 TraceCheckUtils]: 78: Hoare triple {15883#(<= ~counter~0 5)} assume !(0 == ~cond); {15883#(<= ~counter~0 5)} is VALID [2022-04-07 14:33:07,380 INFO L290 TraceCheckUtils]: 79: Hoare triple {15883#(<= ~counter~0 5)} assume true; {15883#(<= ~counter~0 5)} is VALID [2022-04-07 14:33:07,381 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15883#(<= ~counter~0 5)} {15883#(<= ~counter~0 5)} #84#return; {15883#(<= ~counter~0 5)} is VALID [2022-04-07 14:33:07,381 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-07 14:33:07,381 INFO L290 TraceCheckUtils]: 82: Hoare triple {15883#(<= ~counter~0 5)} ~cond := #in~cond; {15883#(<= ~counter~0 5)} is VALID [2022-04-07 14:33:07,381 INFO L290 TraceCheckUtils]: 83: Hoare triple {15883#(<= ~counter~0 5)} assume !(0 == ~cond); {15883#(<= ~counter~0 5)} is VALID [2022-04-07 14:33:07,382 INFO L290 TraceCheckUtils]: 84: Hoare triple {15883#(<= ~counter~0 5)} assume true; {15883#(<= ~counter~0 5)} is VALID [2022-04-07 14:33:07,382 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15883#(<= ~counter~0 5)} {15883#(<= ~counter~0 5)} #86#return; {15883#(<= ~counter~0 5)} is VALID [2022-04-07 14:33:07,382 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-07 14:33:07,383 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-07 14:33:07,383 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-07 14:33:07,383 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-07 14:33:07,384 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-07 14:33:07,384 INFO L290 TraceCheckUtils]: 91: Hoare triple {15926#(<= ~counter~0 6)} ~cond := #in~cond; {15926#(<= ~counter~0 6)} is VALID [2022-04-07 14:33:07,384 INFO L290 TraceCheckUtils]: 92: Hoare triple {15926#(<= ~counter~0 6)} assume !(0 == ~cond); {15926#(<= ~counter~0 6)} is VALID [2022-04-07 14:33:07,384 INFO L290 TraceCheckUtils]: 93: Hoare triple {15926#(<= ~counter~0 6)} assume true; {15926#(<= ~counter~0 6)} is VALID [2022-04-07 14:33:07,385 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15926#(<= ~counter~0 6)} {15926#(<= ~counter~0 6)} #84#return; {15926#(<= ~counter~0 6)} is VALID [2022-04-07 14:33:07,385 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-07 14:33:07,386 INFO L290 TraceCheckUtils]: 96: Hoare triple {15926#(<= ~counter~0 6)} ~cond := #in~cond; {15926#(<= ~counter~0 6)} is VALID [2022-04-07 14:33:07,386 INFO L290 TraceCheckUtils]: 97: Hoare triple {15926#(<= ~counter~0 6)} assume !(0 == ~cond); {15926#(<= ~counter~0 6)} is VALID [2022-04-07 14:33:07,386 INFO L290 TraceCheckUtils]: 98: Hoare triple {15926#(<= ~counter~0 6)} assume true; {15926#(<= ~counter~0 6)} is VALID [2022-04-07 14:33:07,386 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {15926#(<= ~counter~0 6)} {15926#(<= ~counter~0 6)} #86#return; {15926#(<= ~counter~0 6)} is VALID [2022-04-07 14:33:07,387 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-07 14:33:07,387 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-07 14:33:07,387 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-07 14:33:07,388 INFO L290 TraceCheckUtils]: 103: Hoare triple {15969#(<= |main_#t~post6| 6)} assume !(#t~post6 < 20);havoc #t~post6; {15652#false} is VALID [2022-04-07 14:33:07,388 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-07 14:33:07,388 INFO L290 TraceCheckUtils]: 105: Hoare triple {15652#false} ~cond := #in~cond; {15652#false} is VALID [2022-04-07 14:33:07,388 INFO L290 TraceCheckUtils]: 106: Hoare triple {15652#false} assume 0 == ~cond; {15652#false} is VALID [2022-04-07 14:33:07,388 INFO L290 TraceCheckUtils]: 107: Hoare triple {15652#false} assume !false; {15652#false} is VALID [2022-04-07 14:33:07,388 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-07 14:33:07,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:33:07,811 INFO L290 TraceCheckUtils]: 107: Hoare triple {15652#false} assume !false; {15652#false} is VALID [2022-04-07 14:33:07,811 INFO L290 TraceCheckUtils]: 106: Hoare triple {15652#false} assume 0 == ~cond; {15652#false} is VALID [2022-04-07 14:33:07,811 INFO L290 TraceCheckUtils]: 105: Hoare triple {15652#false} ~cond := #in~cond; {15652#false} is VALID [2022-04-07 14:33:07,811 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-07 14:33:07,812 INFO L290 TraceCheckUtils]: 103: Hoare triple {15997#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {15652#false} is VALID [2022-04-07 14:33:07,812 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-07 14:33:07,812 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-07 14:33:07,812 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-07 14:33:07,813 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {15651#true} {16001#(< ~counter~0 20)} #86#return; {16001#(< ~counter~0 20)} is VALID [2022-04-07 14:33:07,813 INFO L290 TraceCheckUtils]: 98: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,813 INFO L290 TraceCheckUtils]: 97: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,813 INFO L290 TraceCheckUtils]: 96: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,813 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-07 14:33:07,814 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15651#true} {16001#(< ~counter~0 20)} #84#return; {16001#(< ~counter~0 20)} is VALID [2022-04-07 14:33:07,814 INFO L290 TraceCheckUtils]: 93: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,814 INFO L290 TraceCheckUtils]: 92: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,814 INFO L290 TraceCheckUtils]: 91: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,814 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-07 14:33:07,821 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-07 14:33:07,822 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-07 14:33:07,822 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-07 14:33:07,822 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-07 14:33:07,823 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15651#true} {16044#(< ~counter~0 19)} #86#return; {16044#(< ~counter~0 19)} is VALID [2022-04-07 14:33:07,823 INFO L290 TraceCheckUtils]: 84: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,823 INFO L290 TraceCheckUtils]: 83: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,823 INFO L290 TraceCheckUtils]: 82: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,823 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-07 14:33:07,824 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15651#true} {16044#(< ~counter~0 19)} #84#return; {16044#(< ~counter~0 19)} is VALID [2022-04-07 14:33:07,824 INFO L290 TraceCheckUtils]: 79: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,824 INFO L290 TraceCheckUtils]: 78: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,824 INFO L290 TraceCheckUtils]: 77: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,824 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-07 14:33:07,824 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-07 14:33:07,825 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-07 14:33:07,825 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-07 14:33:07,825 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-07 14:33:07,825 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15651#true} {16087#(< ~counter~0 18)} #86#return; {16087#(< ~counter~0 18)} is VALID [2022-04-07 14:33:07,826 INFO L290 TraceCheckUtils]: 70: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,826 INFO L290 TraceCheckUtils]: 69: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,826 INFO L290 TraceCheckUtils]: 68: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,826 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-07 14:33:07,826 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15651#true} {16087#(< ~counter~0 18)} #84#return; {16087#(< ~counter~0 18)} is VALID [2022-04-07 14:33:07,826 INFO L290 TraceCheckUtils]: 65: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,826 INFO L290 TraceCheckUtils]: 64: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,826 INFO L290 TraceCheckUtils]: 63: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,826 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-07 14:33:07,827 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-07 14:33:07,827 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-07 14:33:07,827 INFO L290 TraceCheckUtils]: 59: Hoare triple {16130#(< ~counter~0 17)} assume !(~r~0 >= ~d~0); {16130#(< ~counter~0 17)} is VALID [2022-04-07 14:33:07,828 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15651#true} {16130#(< ~counter~0 17)} #82#return; {16130#(< ~counter~0 17)} is VALID [2022-04-07 14:33:07,828 INFO L290 TraceCheckUtils]: 57: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,828 INFO L290 TraceCheckUtils]: 56: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,828 INFO L290 TraceCheckUtils]: 55: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,828 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-07 14:33:07,829 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15651#true} {16130#(< ~counter~0 17)} #80#return; {16130#(< ~counter~0 17)} is VALID [2022-04-07 14:33:07,829 INFO L290 TraceCheckUtils]: 52: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,829 INFO L290 TraceCheckUtils]: 51: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,829 INFO L290 TraceCheckUtils]: 50: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,829 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-07 14:33:07,829 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15651#true} {16130#(< ~counter~0 17)} #78#return; {16130#(< ~counter~0 17)} is VALID [2022-04-07 14:33:07,829 INFO L290 TraceCheckUtils]: 47: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,829 INFO L290 TraceCheckUtils]: 46: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,829 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-07 14:33:07,830 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-07 14:33:07,830 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-07 14:33:07,830 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-07 14:33:07,831 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15651#true} {16185#(< ~counter~0 16)} #82#return; {16185#(< ~counter~0 16)} is VALID [2022-04-07 14:33:07,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,831 INFO L290 TraceCheckUtils]: 38: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,831 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-07 14:33:07,831 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15651#true} {16185#(< ~counter~0 16)} #80#return; {16185#(< ~counter~0 16)} is VALID [2022-04-07 14:33:07,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,832 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-07 14:33:07,832 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15651#true} {16185#(< ~counter~0 16)} #78#return; {16185#(< ~counter~0 16)} is VALID [2022-04-07 14:33:07,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,832 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-07 14:33:07,833 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-07 14:33:07,833 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-07 14:33:07,833 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-07 14:33:07,834 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15651#true} {16240#(< ~counter~0 15)} #82#return; {16240#(< ~counter~0 15)} is VALID [2022-04-07 14:33:07,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,834 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-07 14:33:07,834 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15651#true} {16240#(< ~counter~0 15)} #80#return; {16240#(< ~counter~0 15)} is VALID [2022-04-07 14:33:07,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,835 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-07 14:33:07,835 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15651#true} {16240#(< ~counter~0 15)} #78#return; {16240#(< ~counter~0 15)} is VALID [2022-04-07 14:33:07,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-07 14:33:07,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-07 14:33:07,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-07 14:33:07,835 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-07 14:33:07,835 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-07 14:33:07,836 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-07 14:33:07,836 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-07 14:33:07,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {16295#(< ~counter~0 14)} call #t~ret7 := main(); {16295#(< ~counter~0 14)} is VALID [2022-04-07 14:33:07,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16295#(< ~counter~0 14)} {15651#true} #92#return; {16295#(< ~counter~0 14)} is VALID [2022-04-07 14:33:07,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {16295#(< ~counter~0 14)} assume true; {16295#(< ~counter~0 14)} is VALID [2022-04-07 14:33:07,837 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-07 14:33:07,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {15651#true} call ULTIMATE.init(); {15651#true} is VALID [2022-04-07 14:33:07,838 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-07 14:33:07,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:33:07,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630463951] [2022-04-07 14:33:07,838 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:33:07,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022673158] [2022-04-07 14:33:07,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022673158] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:33:07,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:33:07,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-07 14:33:07,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065486656] [2022-04-07 14:33:07,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:33:07,839 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-07 14:33:07,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:33:07,839 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-07 14:33:07,934 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-07 14:33:07,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 14:33:07,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:33:07,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 14:33:07,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-07 14:33:07,935 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-07 14:33:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:09,919 INFO L93 Difference]: Finished difference Result 1159 states and 1613 transitions. [2022-04-07 14:33:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-07 14:33:09,919 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-07 14:33:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:33:09,920 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-07 14:33:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 363 transitions. [2022-04-07 14:33:09,929 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-07 14:33:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 363 transitions. [2022-04-07 14:33:09,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 363 transitions. [2022-04-07 14:33:10,189 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-07 14:33:10,236 INFO L225 Difference]: With dead ends: 1159 [2022-04-07 14:33:10,236 INFO L226 Difference]: Without dead ends: 1122 [2022-04-07 14:33:10,237 INFO L912 BasicCegarLoop]: 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-07 14:33:10,237 INFO L913 BasicCegarLoop]: 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-07 14:33:10,237 INFO L914 BasicCegarLoop]: 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-07 14:33:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-04-07 14:33:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1097. [2022-04-07 14:33:10,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:33:10,926 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-07 14:33:10,927 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-07 14:33:10,928 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-07 14:33:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:10,966 INFO L93 Difference]: Finished difference Result 1122 states and 1474 transitions. [2022-04-07 14:33:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1474 transitions. [2022-04-07 14:33:10,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:33:10,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:33:10,970 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-07 14:33:10,971 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-07 14:33:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:11,010 INFO L93 Difference]: Finished difference Result 1122 states and 1474 transitions. [2022-04-07 14:33:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1474 transitions. [2022-04-07 14:33:11,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:33:11,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:33:11,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:33:11,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:33:11,015 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-07 14:33:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1457 transitions. [2022-04-07 14:33:11,061 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1457 transitions. Word has length 108 [2022-04-07 14:33:11,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:33:11,061 INFO L478 AbstractCegarLoop]: Abstraction has 1097 states and 1457 transitions. [2022-04-07 14:33:11,061 INFO L479 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-07 14:33:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1457 transitions. [2022-04-07 14:33:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-07 14:33:11,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:33:11,062 INFO L499 BasicCegarLoop]: 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-07 14:33:11,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-07 14:33:11,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-07 14:33:11,279 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:33:11,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:33:11,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1873291208, now seen corresponding path program 1 times [2022-04-07 14:33:11,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:33:11,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311452661] [2022-04-07 14:33:11,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:33:11,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:33:11,294 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:33:11,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1986248312] [2022-04-07 14:33:11,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:33:11,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:33:11,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:33:11,296 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-07 14:33:11,297 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-07 14:33:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:33:11,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-07 14:33:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:33:11,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:33:11,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {21622#true} call ULTIMATE.init(); {21622#true} is VALID [2022-04-07 14:33:11,822 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-07 14:33:11,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21622#true} {21622#true} #92#return; {21622#true} is VALID [2022-04-07 14:33:11,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {21622#true} call #t~ret7 := main(); {21622#true} is VALID [2022-04-07 14:33:11,823 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-07 14:33:11,823 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-07 14:33:11,823 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-07 14:33:11,823 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-07 14:33:11,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,824 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-07 14:33:11,824 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-07 14:33:11,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,825 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-07 14:33:11,825 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-07 14:33:11,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,825 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-07 14:33:11,826 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-07 14:33:11,826 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-07 14:33:11,827 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-07 14:33:11,827 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-07 14:33:11,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,827 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-07 14:33:11,827 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-07 14:33:11,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,828 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-07 14:33:11,828 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-07 14:33:11,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,828 INFO L290 TraceCheckUtils]: 39: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,829 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-07 14:33:11,829 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-07 14:33:11,830 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-07 14:33:11,830 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-07 14:33:11,830 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-07 14:33:11,830 INFO L290 TraceCheckUtils]: 45: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,830 INFO L290 TraceCheckUtils]: 47: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,831 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-07 14:33:11,831 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-07 14:33:11,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,831 INFO L290 TraceCheckUtils]: 51: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,831 INFO L290 TraceCheckUtils]: 52: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,831 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-07 14:33:11,831 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-07 14:33:11,831 INFO L290 TraceCheckUtils]: 55: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,832 INFO L290 TraceCheckUtils]: 56: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,832 INFO L290 TraceCheckUtils]: 57: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,832 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-07 14:33:11,833 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-07 14:33:11,833 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-07 14:33:11,833 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-07 14:33:11,834 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-07 14:33:11,834 INFO L290 TraceCheckUtils]: 63: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,834 INFO L290 TraceCheckUtils]: 64: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,834 INFO L290 TraceCheckUtils]: 65: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,834 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-07 14:33:11,834 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-07 14:33:11,834 INFO L290 TraceCheckUtils]: 68: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,834 INFO L290 TraceCheckUtils]: 69: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,834 INFO L290 TraceCheckUtils]: 70: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,835 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-07 14:33:11,836 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-07 14:33:11,836 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-07 14:33:11,836 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-07 14:33:11,837 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-07 14:33:11,837 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-07 14:33:11,837 INFO L290 TraceCheckUtils]: 77: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,837 INFO L290 TraceCheckUtils]: 78: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,837 INFO L290 TraceCheckUtils]: 79: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,837 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-07 14:33:11,838 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-07 14:33:11,838 INFO L290 TraceCheckUtils]: 82: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,838 INFO L290 TraceCheckUtils]: 83: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,838 INFO L290 TraceCheckUtils]: 84: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,838 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-07 14:33:11,839 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-07 14:33:11,839 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-07 14:33:11,839 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-07 14:33:11,840 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-07 14:33:11,840 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-07 14:33:11,840 INFO L290 TraceCheckUtils]: 91: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,840 INFO L290 TraceCheckUtils]: 92: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,840 INFO L290 TraceCheckUtils]: 93: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,840 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-07 14:33:11,841 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-07 14:33:11,841 INFO L290 TraceCheckUtils]: 96: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,841 INFO L290 TraceCheckUtils]: 97: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,841 INFO L290 TraceCheckUtils]: 98: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,841 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-07 14:33:11,841 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-07 14:33:11,842 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-07 14:33:11,842 INFO L290 TraceCheckUtils]: 102: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:11,842 INFO L290 TraceCheckUtils]: 103: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:11,842 INFO L290 TraceCheckUtils]: 104: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:11,842 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-07 14:33:11,843 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-07 14:33:11,843 INFO L290 TraceCheckUtils]: 107: Hoare triple {21948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:33:11,843 INFO L290 TraceCheckUtils]: 108: Hoare triple {21952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21623#false} is VALID [2022-04-07 14:33:11,843 INFO L290 TraceCheckUtils]: 109: Hoare triple {21623#false} assume !false; {21623#false} is VALID [2022-04-07 14:33:11,844 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-07 14:33:11,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:33:12,964 INFO L290 TraceCheckUtils]: 109: Hoare triple {21623#false} assume !false; {21623#false} is VALID [2022-04-07 14:33:12,965 INFO L290 TraceCheckUtils]: 108: Hoare triple {21952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21623#false} is VALID [2022-04-07 14:33:12,965 INFO L290 TraceCheckUtils]: 107: Hoare triple {21948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:33:12,966 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-07 14:33:12,966 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-07 14:33:12,966 INFO L290 TraceCheckUtils]: 104: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,966 INFO L290 TraceCheckUtils]: 103: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,966 INFO L290 TraceCheckUtils]: 102: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,966 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-07 14:33:12,967 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-07 14:33:12,967 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-07 14:33:12,967 INFO L290 TraceCheckUtils]: 98: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,967 INFO L290 TraceCheckUtils]: 97: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,967 INFO L290 TraceCheckUtils]: 96: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,967 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-07 14:33:12,968 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-07 14:33:12,968 INFO L290 TraceCheckUtils]: 93: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,968 INFO L290 TraceCheckUtils]: 92: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,968 INFO L290 TraceCheckUtils]: 91: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,968 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-07 14:33:12,968 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-07 14:33:12,969 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-07 14:33:12,969 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-07 14:33:12,970 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-07 14:33:12,971 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-07 14:33:12,971 INFO L290 TraceCheckUtils]: 84: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,971 INFO L290 TraceCheckUtils]: 83: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,971 INFO L290 TraceCheckUtils]: 82: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,971 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-07 14:33:12,973 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-07 14:33:12,973 INFO L290 TraceCheckUtils]: 79: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,973 INFO L290 TraceCheckUtils]: 78: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,973 INFO L290 TraceCheckUtils]: 77: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,973 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-07 14:33:12,974 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-07 14:33:12,977 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-07 14:33:12,978 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-07 14:33:12,981 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-07 14:33:12,982 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-07 14:33:12,982 INFO L290 TraceCheckUtils]: 70: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,982 INFO L290 TraceCheckUtils]: 69: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,982 INFO L290 TraceCheckUtils]: 68: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,982 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-07 14:33:12,982 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-07 14:33:12,982 INFO L290 TraceCheckUtils]: 65: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,983 INFO L290 TraceCheckUtils]: 63: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,983 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-07 14:33:12,984 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-07 14:33:12,984 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-07 14:33:12,985 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-07 14:33:12,986 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-07 14:33:12,986 INFO L290 TraceCheckUtils]: 57: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,986 INFO L290 TraceCheckUtils]: 56: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,986 INFO L290 TraceCheckUtils]: 55: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,986 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-07 14:33:12,986 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-07 14:33:12,986 INFO L290 TraceCheckUtils]: 52: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,986 INFO L290 TraceCheckUtils]: 51: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,987 INFO L290 TraceCheckUtils]: 50: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,987 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-07 14:33:12,987 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-07 14:33:12,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,987 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-07 14:33:12,988 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-07 14:33:12,989 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-07 14:33:12,991 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-07 14:33:12,992 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-07 14:33:12,992 INFO L290 TraceCheckUtils]: 39: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,992 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-07 14:33:12,992 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-07 14:33:12,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,993 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-07 14:33:12,993 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-07 14:33:12,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,993 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-07 14:33:12,995 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-07 14:33:12,996 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-07 14:33:12,997 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-07 14:33:12,997 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-07 14:33:12,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,998 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-07 14:33:12,998 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-07 14:33:12,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,998 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-07 14:33:12,999 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-07 14:33:12,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:12,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-07 14:33:12,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-07 14:33:12,999 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-07 14:33:12,999 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-07 14:33:12,999 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-07 14:33:13,000 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-07 14:33:13,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {21622#true} call #t~ret7 := main(); {21622#true} is VALID [2022-04-07 14:33:13,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21622#true} {21622#true} #92#return; {21622#true} is VALID [2022-04-07 14:33:13,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-07 14:33:13,000 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-07 14:33:13,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {21622#true} call ULTIMATE.init(); {21622#true} is VALID [2022-04-07 14:33:13,001 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-07 14:33:13,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:33:13,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311452661] [2022-04-07 14:33:13,001 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:33:13,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986248312] [2022-04-07 14:33:13,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986248312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:33:13,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:33:13,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-07 14:33:13,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114261073] [2022-04-07 14:33:13,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:33:13,002 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-07 14:33:13,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:33:13,002 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-07 14:33:13,114 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-07 14:33:13,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 14:33:13,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:33:13,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 14:33:13,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:33:13,115 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-07 14:33:15,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:15,729 INFO L93 Difference]: Finished difference Result 1103 states and 1463 transitions. [2022-04-07 14:33:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 14:33:15,729 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-07 14:33:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:33:15,729 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-07 14:33:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-07 14:33:15,730 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-07 14:33:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-07 14:33:15,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2022-04-07 14:33:15,799 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-07 14:33:15,844 INFO L225 Difference]: With dead ends: 1103 [2022-04-07 14:33:15,844 INFO L226 Difference]: Without dead ends: 1097 [2022-04-07 14:33:15,845 INFO L912 BasicCegarLoop]: 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-07 14:33:15,845 INFO L913 BasicCegarLoop]: 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-07 14:33:15,845 INFO L914 BasicCegarLoop]: 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-07 14:33:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-04-07 14:33:16,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2022-04-07 14:33:16,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:33:16,512 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-07 14:33:16,513 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-07 14:33:16,514 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-07 14:33:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:16,552 INFO L93 Difference]: Finished difference Result 1097 states and 1455 transitions. [2022-04-07 14:33:16,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1455 transitions. [2022-04-07 14:33:16,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:33:16,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:33:16,556 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-07 14:33:16,557 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-07 14:33:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:16,595 INFO L93 Difference]: Finished difference Result 1097 states and 1455 transitions. [2022-04-07 14:33:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1455 transitions. [2022-04-07 14:33:16,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:33:16,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:33:16,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:33:16,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:33:16,599 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-07 14:33:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1455 transitions. [2022-04-07 14:33:16,644 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1455 transitions. Word has length 110 [2022-04-07 14:33:16,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:33:16,645 INFO L478 AbstractCegarLoop]: Abstraction has 1097 states and 1455 transitions. [2022-04-07 14:33:16,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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-07 14:33:16,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1455 transitions. [2022-04-07 14:33:16,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-07 14:33:16,646 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:33:16,646 INFO L499 BasicCegarLoop]: 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-07 14:33:16,666 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-07 14:33:16,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-07 14:33:16,859 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:33:16,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:33:16,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1491499276, now seen corresponding path program 2 times [2022-04-07 14:33:16,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:33:16,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741659279] [2022-04-07 14:33:16,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:33:16,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:33:16,870 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:33:16,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401642201] [2022-04-07 14:33:16,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 14:33:16,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:33:16,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:33:16,871 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-07 14:33:16,872 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-07 14:33:16,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 14:33:16,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:33:16,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 14:33:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:33:16,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:33:17,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {27456#true} call ULTIMATE.init(); {27456#true} is VALID [2022-04-07 14:33:17,154 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-07 14:33:17,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27456#true} {27456#true} #92#return; {27456#true} is VALID [2022-04-07 14:33:17,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {27456#true} call #t~ret7 := main(); {27456#true} is VALID [2022-04-07 14:33:17,154 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-07 14:33:17,155 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-07 14:33:17,155 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-07 14:33:17,155 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-07 14:33:17,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,155 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #78#return; {27476#(= main_~p~0 1)} is VALID [2022-04-07 14:33:17,156 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-07 14:33:17,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,156 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #80#return; {27476#(= main_~p~0 1)} is VALID [2022-04-07 14:33:17,156 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-07 14:33:17,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,157 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #82#return; {27476#(= main_~p~0 1)} is VALID [2022-04-07 14:33:17,157 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-07 14:33:17,157 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-07 14:33:17,158 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-07 14:33:17,158 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-07 14:33:17,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,158 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #78#return; {27531#(= main_~p~0 2)} is VALID [2022-04-07 14:33:17,158 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-07 14:33:17,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,158 INFO L290 TraceCheckUtils]: 34: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,159 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #80#return; {27531#(= main_~p~0 2)} is VALID [2022-04-07 14:33:17,159 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-07 14:33:17,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,159 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #82#return; {27531#(= main_~p~0 2)} is VALID [2022-04-07 14:33:17,160 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-07 14:33:17,160 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-07 14:33:17,160 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-07 14:33:17,160 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-07 14:33:17,160 INFO L290 TraceCheckUtils]: 45: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,160 INFO L290 TraceCheckUtils]: 46: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,160 INFO L290 TraceCheckUtils]: 47: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,161 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #78#return; {27586#(= main_~p~0 4)} is VALID [2022-04-07 14:33:17,161 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-07 14:33:17,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,161 INFO L290 TraceCheckUtils]: 52: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,161 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #80#return; {27586#(= main_~p~0 4)} is VALID [2022-04-07 14:33:17,161 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-07 14:33:17,162 INFO L290 TraceCheckUtils]: 55: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,162 INFO L290 TraceCheckUtils]: 56: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,162 INFO L290 TraceCheckUtils]: 57: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,162 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #82#return; {27586#(= main_~p~0 4)} is VALID [2022-04-07 14:33:17,162 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-07 14:33:17,162 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-07 14:33:17,163 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-07 14:33:17,163 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-07 14:33:17,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,163 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #84#return; {27586#(= main_~p~0 4)} is VALID [2022-04-07 14:33:17,164 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-07 14:33:17,164 INFO L290 TraceCheckUtils]: 68: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,164 INFO L290 TraceCheckUtils]: 69: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,164 INFO L290 TraceCheckUtils]: 70: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,164 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #86#return; {27586#(= main_~p~0 4)} is VALID [2022-04-07 14:33:17,164 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-07 14:33:17,165 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-07 14:33:17,165 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-07 14:33:17,165 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-07 14:33:17,165 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-07 14:33:17,166 INFO L290 TraceCheckUtils]: 77: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,166 INFO L290 TraceCheckUtils]: 78: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,166 INFO L290 TraceCheckUtils]: 79: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,166 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #84#return; {27531#(= main_~p~0 2)} is VALID [2022-04-07 14:33:17,166 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-07 14:33:17,166 INFO L290 TraceCheckUtils]: 82: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,166 INFO L290 TraceCheckUtils]: 83: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,166 INFO L290 TraceCheckUtils]: 84: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,167 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #86#return; {27531#(= main_~p~0 2)} is VALID [2022-04-07 14:33:17,167 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-07 14:33:17,167 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-07 14:33:17,168 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-07 14:33:17,168 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-07 14:33:17,168 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-07 14:33:17,168 INFO L290 TraceCheckUtils]: 91: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,168 INFO L290 TraceCheckUtils]: 92: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,168 INFO L290 TraceCheckUtils]: 93: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,168 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #84#return; {27476#(= main_~p~0 1)} is VALID [2022-04-07 14:33:17,169 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-07 14:33:17,169 INFO L290 TraceCheckUtils]: 96: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,169 INFO L290 TraceCheckUtils]: 97: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,169 INFO L290 TraceCheckUtils]: 98: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,169 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #86#return; {27476#(= main_~p~0 1)} is VALID [2022-04-07 14:33:17,169 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-07 14:33:17,170 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-07 14:33:17,170 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-07 14:33:17,170 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-07 14:33:17,170 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-07 14:33:17,170 INFO L290 TraceCheckUtils]: 105: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,170 INFO L290 TraceCheckUtils]: 106: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,170 INFO L290 TraceCheckUtils]: 107: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,171 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {27456#true} {27764#(<= main_~p~0 0)} #84#return; {27764#(<= main_~p~0 0)} is VALID [2022-04-07 14:33:17,171 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-07 14:33:17,171 INFO L290 TraceCheckUtils]: 110: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,171 INFO L290 TraceCheckUtils]: 111: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,171 INFO L290 TraceCheckUtils]: 112: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,171 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {27456#true} {27764#(<= main_~p~0 0)} #86#return; {27764#(<= main_~p~0 0)} is VALID [2022-04-07 14:33:17,172 INFO L290 TraceCheckUtils]: 114: Hoare triple {27764#(<= main_~p~0 0)} assume !(1 != ~p~0); {27457#false} is VALID [2022-04-07 14:33:17,172 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-07 14:33:17,172 INFO L290 TraceCheckUtils]: 116: Hoare triple {27457#false} ~cond := #in~cond; {27457#false} is VALID [2022-04-07 14:33:17,172 INFO L290 TraceCheckUtils]: 117: Hoare triple {27457#false} assume !(0 == ~cond); {27457#false} is VALID [2022-04-07 14:33:17,172 INFO L290 TraceCheckUtils]: 118: Hoare triple {27457#false} assume true; {27457#false} is VALID [2022-04-07 14:33:17,172 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {27457#false} {27457#false} #88#return; {27457#false} is VALID [2022-04-07 14:33:17,172 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-07 14:33:17,172 INFO L290 TraceCheckUtils]: 121: Hoare triple {27457#false} ~cond := #in~cond; {27457#false} is VALID [2022-04-07 14:33:17,172 INFO L290 TraceCheckUtils]: 122: Hoare triple {27457#false} assume 0 == ~cond; {27457#false} is VALID [2022-04-07 14:33:17,172 INFO L290 TraceCheckUtils]: 123: Hoare triple {27457#false} assume !false; {27457#false} is VALID [2022-04-07 14:33:17,173 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-07 14:33:17,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:33:17,944 INFO L290 TraceCheckUtils]: 123: Hoare triple {27457#false} assume !false; {27457#false} is VALID [2022-04-07 14:33:17,944 INFO L290 TraceCheckUtils]: 122: Hoare triple {27457#false} assume 0 == ~cond; {27457#false} is VALID [2022-04-07 14:33:17,944 INFO L290 TraceCheckUtils]: 121: Hoare triple {27457#false} ~cond := #in~cond; {27457#false} is VALID [2022-04-07 14:33:17,944 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-07 14:33:17,944 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {27456#true} {27457#false} #88#return; {27457#false} is VALID [2022-04-07 14:33:17,944 INFO L290 TraceCheckUtils]: 118: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,944 INFO L290 TraceCheckUtils]: 117: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,944 INFO L290 TraceCheckUtils]: 116: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,944 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-07 14:33:17,945 INFO L290 TraceCheckUtils]: 114: Hoare triple {27764#(<= main_~p~0 0)} assume !(1 != ~p~0); {27457#false} is VALID [2022-04-07 14:33:17,945 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {27456#true} {27764#(<= main_~p~0 0)} #86#return; {27764#(<= main_~p~0 0)} is VALID [2022-04-07 14:33:17,945 INFO L290 TraceCheckUtils]: 112: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,945 INFO L290 TraceCheckUtils]: 111: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,945 INFO L290 TraceCheckUtils]: 110: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,946 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-07 14:33:17,946 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {27456#true} {27764#(<= main_~p~0 0)} #84#return; {27764#(<= main_~p~0 0)} is VALID [2022-04-07 14:33:17,946 INFO L290 TraceCheckUtils]: 107: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,946 INFO L290 TraceCheckUtils]: 106: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,946 INFO L290 TraceCheckUtils]: 105: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,946 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-07 14:33:17,962 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-07 14:33:17,963 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-07 14:33:17,963 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-07 14:33:17,964 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-07 14:33:17,964 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-07 14:33:17,964 INFO L290 TraceCheckUtils]: 98: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,964 INFO L290 TraceCheckUtils]: 97: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,965 INFO L290 TraceCheckUtils]: 96: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,965 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-07 14:33:17,965 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-07 14:33:17,965 INFO L290 TraceCheckUtils]: 93: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,965 INFO L290 TraceCheckUtils]: 92: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,965 INFO L290 TraceCheckUtils]: 91: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,965 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-07 14:33:17,966 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-07 14:33:17,966 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-07 14:33:17,966 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-07 14:33:17,967 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-07 14:33:17,967 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-07 14:33:17,967 INFO L290 TraceCheckUtils]: 84: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,967 INFO L290 TraceCheckUtils]: 83: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,968 INFO L290 TraceCheckUtils]: 82: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,968 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-07 14:33:17,968 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-07 14:33:17,968 INFO L290 TraceCheckUtils]: 79: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,968 INFO L290 TraceCheckUtils]: 78: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,968 INFO L290 TraceCheckUtils]: 77: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,968 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-07 14:33:17,969 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-07 14:33:17,969 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-07 14:33:17,969 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-07 14:33:17,970 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-07 14:33:17,970 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-07 14:33:17,971 INFO L290 TraceCheckUtils]: 70: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,971 INFO L290 TraceCheckUtils]: 69: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,971 INFO L290 TraceCheckUtils]: 68: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,971 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-07 14:33:17,971 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-07 14:33:17,971 INFO L290 TraceCheckUtils]: 65: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,971 INFO L290 TraceCheckUtils]: 64: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,971 INFO L290 TraceCheckUtils]: 63: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,971 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-07 14:33:17,972 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-07 14:33:17,972 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-07 14:33:17,972 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-07 14:33:17,972 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-07 14:33:17,973 INFO L290 TraceCheckUtils]: 57: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,973 INFO L290 TraceCheckUtils]: 56: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,973 INFO L290 TraceCheckUtils]: 55: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,973 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-07 14:33:17,973 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-07 14:33:17,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,973 INFO L290 TraceCheckUtils]: 51: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,973 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-07 14:33:17,979 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-07 14:33:17,979 INFO L290 TraceCheckUtils]: 47: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,979 INFO L290 TraceCheckUtils]: 46: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,979 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-07 14:33:17,980 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-07 14:33:17,980 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-07 14:33:17,981 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-07 14:33:17,981 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-07 14:33:17,981 INFO L290 TraceCheckUtils]: 39: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,981 INFO L290 TraceCheckUtils]: 38: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,981 INFO L290 TraceCheckUtils]: 37: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,981 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-07 14:33:17,982 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-07 14:33:17,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,982 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-07 14:33:17,982 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-07 14:33:17,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,983 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-07 14:33:17,983 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-07 14:33:17,983 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-07 14:33:17,984 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-07 14:33:17,984 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-07 14:33:17,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,985 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-07 14:33:17,985 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-07 14:33:17,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,985 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-07 14:33:17,986 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-07 14:33:17,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-07 14:33:17,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-07 14:33:17,986 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-07 14:33:17,986 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-07 14:33:17,986 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-07 14:33:17,987 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-07 14:33:17,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {27456#true} call #t~ret7 := main(); {27456#true} is VALID [2022-04-07 14:33:17,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27456#true} {27456#true} #92#return; {27456#true} is VALID [2022-04-07 14:33:17,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-07 14:33:17,987 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-07 14:33:17,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {27456#true} call ULTIMATE.init(); {27456#true} is VALID [2022-04-07 14:33:17,987 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-07 14:33:17,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:33:17,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741659279] [2022-04-07 14:33:17,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:33:17,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401642201] [2022-04-07 14:33:17,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401642201] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:33:17,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:33:17,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-07 14:33:17,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290434953] [2022-04-07 14:33:17,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:33:17,989 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-07 14:33:17,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:33:17,989 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-07 14:33:18,088 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-07 14:33:18,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 14:33:18,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:33:18,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 14:33:18,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-07 14:33:18,089 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-07 14:33:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:19,046 INFO L93 Difference]: Finished difference Result 1320 states and 1738 transitions. [2022-04-07 14:33:19,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:33:19,046 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-07 14:33:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:33:19,047 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-07 14:33:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-04-07 14:33:19,048 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-07 14:33:19,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-04-07 14:33:19,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2022-04-07 14:33:19,119 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-07 14:33:19,151 INFO L225 Difference]: With dead ends: 1320 [2022-04-07 14:33:19,151 INFO L226 Difference]: Without dead ends: 907 [2022-04-07 14:33:19,152 INFO L912 BasicCegarLoop]: 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-07 14:33:19,152 INFO L913 BasicCegarLoop]: 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-07 14:33:19,153 INFO L914 BasicCegarLoop]: 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-07 14:33:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-07 14:33:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 905. [2022-04-07 14:33:19,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:33:19,737 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-07 14:33:19,738 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-07 14:33:19,739 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-07 14:33:19,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:19,764 INFO L93 Difference]: Finished difference Result 907 states and 1156 transitions. [2022-04-07 14:33:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1156 transitions. [2022-04-07 14:33:19,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:33:19,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:33:19,767 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-07 14:33:19,768 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-07 14:33:19,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:33:19,794 INFO L93 Difference]: Finished difference Result 907 states and 1156 transitions. [2022-04-07 14:33:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1156 transitions. [2022-04-07 14:33:19,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:33:19,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:33:19,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:33:19,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:33:19,797 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-07 14:33:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1153 transitions. [2022-04-07 14:33:19,829 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1153 transitions. Word has length 124 [2022-04-07 14:33:19,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:33:19,829 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1153 transitions. [2022-04-07 14:33:19,829 INFO L479 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-07 14:33:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1153 transitions. [2022-04-07 14:33:19,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-07 14:33:19,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:33:19,830 INFO L499 BasicCegarLoop]: 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-07 14:33:19,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-07 14:33:20,052 WARN L460 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-07 14:33:20,052 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:33:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:33:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1372095454, now seen corresponding path program 3 times [2022-04-07 14:33:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:33:20,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619620250] [2022-04-07 14:33:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:33:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:33:20,068 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:33:20,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598763815] [2022-04-07 14:33:20,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 14:33:20,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:33:20,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:33:20,069 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-07 14:33:20,070 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-07 14:33:20,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 14:33:20,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:33:20,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-07 14:33:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:33:20,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:33:27,048 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 14:33:31,423 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 14:33:36,182 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 14:33:36,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {33033#true} call ULTIMATE.init(); {33033#true} is VALID [2022-04-07 14:33:36,531 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-07 14:33:36,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33033#true} {33033#true} #92#return; {33033#true} is VALID [2022-04-07 14:33:36,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {33033#true} call #t~ret7 := main(); {33033#true} is VALID [2022-04-07 14:33:36,531 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-07 14:33:36,532 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-07 14:33:36,532 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-07 14:33:36,532 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-07 14:33:36,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,533 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #78#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,533 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-07 14:33:36,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,533 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #80#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,555 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-07 14:33:36,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,557 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #82#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,558 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-07 14:33:36,559 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-07 14:33:36,559 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-07 14:33:36,559 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-07 14:33:36,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,560 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #78#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,560 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-07 14:33:36,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,561 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #80#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,561 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-07 14:33:36,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,561 INFO L290 TraceCheckUtils]: 39: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,561 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #82#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,562 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-07 14:33:36,562 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-07 14:33:36,562 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-07 14:33:36,562 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-07 14:33:36,562 INFO L290 TraceCheckUtils]: 45: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,562 INFO L290 TraceCheckUtils]: 46: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,562 INFO L290 TraceCheckUtils]: 47: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,563 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #78#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,563 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-07 14:33:36,563 INFO L290 TraceCheckUtils]: 50: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,563 INFO L290 TraceCheckUtils]: 51: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,563 INFO L290 TraceCheckUtils]: 52: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,563 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #80#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,563 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-07 14:33:36,563 INFO L290 TraceCheckUtils]: 55: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,563 INFO L290 TraceCheckUtils]: 57: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,564 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #82#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,564 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-07 14:33:36,564 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-07 14:33:36,565 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-07 14:33:36,565 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-07 14:33:36,565 INFO L290 TraceCheckUtils]: 63: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,565 INFO L290 TraceCheckUtils]: 64: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,565 INFO L290 TraceCheckUtils]: 65: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,565 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #78#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,565 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-07 14:33:36,565 INFO L290 TraceCheckUtils]: 68: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,565 INFO L290 TraceCheckUtils]: 70: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,566 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #80#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,566 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-07 14:33:36,566 INFO L290 TraceCheckUtils]: 73: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,566 INFO L290 TraceCheckUtils]: 74: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,566 INFO L290 TraceCheckUtils]: 75: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,566 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #82#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,567 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-07 14:33:36,567 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-07 14:33:36,567 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-07 14:33:36,567 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-07 14:33:36,567 INFO L290 TraceCheckUtils]: 81: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,567 INFO L290 TraceCheckUtils]: 82: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,567 INFO L290 TraceCheckUtils]: 83: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,568 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #84#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,568 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-07 14:33:36,568 INFO L290 TraceCheckUtils]: 86: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,568 INFO L290 TraceCheckUtils]: 87: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,568 INFO L290 TraceCheckUtils]: 88: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,568 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #86#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,569 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-07 14:33:36,569 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-07 14:33:36,569 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-07 14:33:36,569 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-07 14:33:36,569 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-07 14:33:36,570 INFO L290 TraceCheckUtils]: 95: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,570 INFO L290 TraceCheckUtils]: 96: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,570 INFO L290 TraceCheckUtils]: 97: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,570 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #84#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,570 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-07 14:33:36,570 INFO L290 TraceCheckUtils]: 100: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-07 14:33:36,570 INFO L290 TraceCheckUtils]: 101: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-07 14:33:36,570 INFO L290 TraceCheckUtils]: 102: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-07 14:33:36,571 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #86#return; {33053#(= main_~B~0 1)} is VALID [2022-04-07 14:33:36,571 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-07 14:33:36,571 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-07 14:33:36,571 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-07 14:33:36,572 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-07 14:33:36,572 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-07 14:33:36,572 INFO L290 TraceCheckUtils]: 109: Hoare triple {33033#true} ~cond := #in~cond; {33366#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:33:36,572 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-07 14:33:36,573 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-07 14:33:36,573 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-07 14:33:36,573 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-07 14:33:36,573 INFO L290 TraceCheckUtils]: 114: Hoare triple {33033#true} ~cond := #in~cond; {33366#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:33:36,574 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-07 14:33:36,574 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-07 14:33:36,575 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-07 14:33:36,576 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-07 14:33:36,577 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-07 14:33:36,577 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-07 14:33:36,578 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-07 14:33:36,578 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-07 14:33:36,579 INFO L290 TraceCheckUtils]: 123: Hoare triple {33409#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33413#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:33:36,579 INFO L290 TraceCheckUtils]: 124: Hoare triple {33413#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33034#false} is VALID [2022-04-07 14:33:36,579 INFO L290 TraceCheckUtils]: 125: Hoare triple {33034#false} assume !false; {33034#false} is VALID [2022-04-07 14:33:36,579 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-07 14:33:36,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:34:14,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:34:14,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619620250] [2022-04-07 14:34:14,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:34:14,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598763815] [2022-04-07 14:34:14,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598763815] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 14:34:14,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 14:34:14,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-07 14:34:14,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195627779] [2022-04-07 14:34:14,765 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 14:34:14,765 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-07 14:34:14,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:34:14,765 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-07 14:34:14,796 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-07 14:34:14,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 14:34:14,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:34:14,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 14:34:14,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-07 14:34:14,797 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-07 14:34:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:34:15,703 INFO L93 Difference]: Finished difference Result 935 states and 1182 transitions. [2022-04-07 14:34:15,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 14:34:15,703 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-07 14:34:15,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:34:15,703 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-07 14:34:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-07 14:34:15,704 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-07 14:34:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-07 14:34:15,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2022-04-07 14:34:15,741 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-07 14:34:15,773 INFO L225 Difference]: With dead ends: 935 [2022-04-07 14:34:15,773 INFO L226 Difference]: Without dead ends: 921 [2022-04-07 14:34:15,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-07 14:34:15,774 INFO L913 BasicCegarLoop]: 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-07 14:34:15,774 INFO L914 BasicCegarLoop]: 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-07 14:34:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-04-07 14:34:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 695. [2022-04-07 14:34:16,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:34:16,315 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-07 14:34:16,315 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-07 14:34:16,316 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-07 14:34:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:34:16,342 INFO L93 Difference]: Finished difference Result 921 states and 1162 transitions. [2022-04-07 14:34:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1162 transitions. [2022-04-07 14:34:16,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:34:16,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:34:16,345 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-07 14:34:16,345 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-07 14:34:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:34:16,371 INFO L93 Difference]: Finished difference Result 921 states and 1162 transitions. [2022-04-07 14:34:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1162 transitions. [2022-04-07 14:34:16,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:34:16,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:34:16,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:34:16,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:34:16,374 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-07 14:34:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 853 transitions. [2022-04-07 14:34:16,393 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 853 transitions. Word has length 126 [2022-04-07 14:34:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:34:16,393 INFO L478 AbstractCegarLoop]: Abstraction has 695 states and 853 transitions. [2022-04-07 14:34:16,393 INFO L479 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-07 14:34:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 853 transitions. [2022-04-07 14:34:16,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-07 14:34:16,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:34:16,394 INFO L499 BasicCegarLoop]: 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-07 14:34:16,413 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-07 14:34:16,611 WARN L460 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-07 14:34:16,611 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:34:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:34:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash 388866286, now seen corresponding path program 3 times [2022-04-07 14:34:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:34:16,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658497647] [2022-04-07 14:34:16,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:34:16,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:34:16,632 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:34:16,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240223794] [2022-04-07 14:34:16,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 14:34:16,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:34:16,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:34:16,633 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-07 14:34:16,635 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-07 14:34:16,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 14:34:16,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:34:16,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 14:34:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:34:16,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:34:16,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {37497#true} call ULTIMATE.init(); {37497#true} is VALID [2022-04-07 14:34:16,941 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-07 14:34:16,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37497#true} {37497#true} #92#return; {37497#true} is VALID [2022-04-07 14:34:16,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {37497#true} call #t~ret7 := main(); {37497#true} is VALID [2022-04-07 14:34:16,941 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-07 14:34:16,942 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-07 14:34:16,942 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-07 14:34:16,942 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-07 14:34:16,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,942 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #78#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,942 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-07 14:34:16,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,943 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #80#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,943 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-07 14:34:16,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,943 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #82#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,944 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-07 14:34:16,944 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-07 14:34:16,944 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-07 14:34:16,944 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-07 14:34:16,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,945 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #78#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,945 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-07 14:34:16,945 INFO L290 TraceCheckUtils]: 32: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,945 INFO L290 TraceCheckUtils]: 33: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,945 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #80#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,945 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-07 14:34:16,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,946 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #82#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,946 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-07 14:34:16,946 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-07 14:34:16,946 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-07 14:34:16,947 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-07 14:34:16,947 INFO L290 TraceCheckUtils]: 45: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,947 INFO L290 TraceCheckUtils]: 46: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,947 INFO L290 TraceCheckUtils]: 47: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,947 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #78#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,947 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-07 14:34:16,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,947 INFO L290 TraceCheckUtils]: 51: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,947 INFO L290 TraceCheckUtils]: 52: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,948 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #80#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,948 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-07 14:34:16,948 INFO L290 TraceCheckUtils]: 55: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,948 INFO L290 TraceCheckUtils]: 56: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,948 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #82#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,948 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-07 14:34:16,949 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-07 14:34:16,949 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-07 14:34:16,949 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-07 14:34:16,949 INFO L290 TraceCheckUtils]: 63: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,949 INFO L290 TraceCheckUtils]: 64: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,949 INFO L290 TraceCheckUtils]: 65: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,949 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #78#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,949 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-07 14:34:16,949 INFO L290 TraceCheckUtils]: 68: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,949 INFO L290 TraceCheckUtils]: 69: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,950 INFO L290 TraceCheckUtils]: 70: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,950 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #80#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,950 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-07 14:34:16,950 INFO L290 TraceCheckUtils]: 73: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,950 INFO L290 TraceCheckUtils]: 74: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,950 INFO L290 TraceCheckUtils]: 75: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,950 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #82#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,951 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-07 14:34:16,951 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-07 14:34:16,951 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-07 14:34:16,951 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-07 14:34:16,951 INFO L290 TraceCheckUtils]: 81: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,951 INFO L290 TraceCheckUtils]: 82: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,951 INFO L290 TraceCheckUtils]: 83: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,952 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #84#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,952 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-07 14:34:16,952 INFO L290 TraceCheckUtils]: 86: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,952 INFO L290 TraceCheckUtils]: 87: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,952 INFO L290 TraceCheckUtils]: 88: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,952 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #86#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,952 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-07 14:34:16,953 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-07 14:34:16,953 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-07 14:34:16,953 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-07 14:34:16,953 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-07 14:34:16,953 INFO L290 TraceCheckUtils]: 95: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,953 INFO L290 TraceCheckUtils]: 96: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,953 INFO L290 TraceCheckUtils]: 97: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,954 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #84#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,954 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-07 14:34:16,954 INFO L290 TraceCheckUtils]: 100: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,954 INFO L290 TraceCheckUtils]: 101: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,954 INFO L290 TraceCheckUtils]: 102: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,954 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #86#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,954 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-07 14:34:16,955 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-07 14:34:16,955 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-07 14:34:16,955 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-07 14:34:16,955 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-07 14:34:16,955 INFO L290 TraceCheckUtils]: 109: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,955 INFO L290 TraceCheckUtils]: 110: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,955 INFO L290 TraceCheckUtils]: 111: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,956 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {37497#true} {37517#(= main_~B~0 1)} #84#return; {37517#(= main_~B~0 1)} is VALID [2022-04-07 14:34:16,956 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-07 14:34:16,956 INFO L290 TraceCheckUtils]: 114: Hoare triple {37497#true} ~cond := #in~cond; {37845#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:34:16,956 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-07 14:34:16,957 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-07 14:34:16,957 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-07 14:34:16,957 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-07 14:34:16,957 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-07 14:34:16,957 INFO L290 TraceCheckUtils]: 120: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:16,957 INFO L290 TraceCheckUtils]: 121: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:16,958 INFO L290 TraceCheckUtils]: 122: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:16,958 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-07 14:34:16,958 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-07 14:34:16,958 INFO L290 TraceCheckUtils]: 125: Hoare triple {37879#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37883#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:34:16,959 INFO L290 TraceCheckUtils]: 126: Hoare triple {37883#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37498#false} is VALID [2022-04-07 14:34:16,959 INFO L290 TraceCheckUtils]: 127: Hoare triple {37498#false} assume !false; {37498#false} is VALID [2022-04-07 14:34:16,959 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-07 14:34:16,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:34:19,943 INFO L290 TraceCheckUtils]: 127: Hoare triple {37498#false} assume !false; {37498#false} is VALID [2022-04-07 14:34:19,944 INFO L290 TraceCheckUtils]: 126: Hoare triple {37883#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37498#false} is VALID [2022-04-07 14:34:19,944 INFO L290 TraceCheckUtils]: 125: Hoare triple {37879#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37883#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:34:19,945 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-07 14:34:19,945 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-07 14:34:19,945 INFO L290 TraceCheckUtils]: 122: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,945 INFO L290 TraceCheckUtils]: 121: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,945 INFO L290 TraceCheckUtils]: 120: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,945 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-07 14:34:19,946 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-07 14:34:19,947 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-07 14:34:19,947 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-07 14:34:19,947 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-07 14:34:19,947 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-07 14:34:19,947 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-07 14:34:19,948 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {37497#true} {37497#true} #84#return; {37497#true} is VALID [2022-04-07 14:34:19,948 INFO L290 TraceCheckUtils]: 111: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,948 INFO L290 TraceCheckUtils]: 110: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,948 INFO L290 TraceCheckUtils]: 109: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,948 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-07 14:34:19,948 INFO L290 TraceCheckUtils]: 107: Hoare triple {37497#true} assume !!(#t~post6 < 20);havoc #t~post6; {37497#true} is VALID [2022-04-07 14:34:19,948 INFO L290 TraceCheckUtils]: 106: Hoare triple {37497#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37497#true} is VALID [2022-04-07 14:34:19,948 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-07 14:34:19,948 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-07 14:34:19,948 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {37497#true} {37497#true} #86#return; {37497#true} is VALID [2022-04-07 14:34:19,948 INFO L290 TraceCheckUtils]: 102: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,948 INFO L290 TraceCheckUtils]: 101: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,948 INFO L290 TraceCheckUtils]: 100: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,948 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-07 14:34:19,948 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {37497#true} {37497#true} #84#return; {37497#true} is VALID [2022-04-07 14:34:19,948 INFO L290 TraceCheckUtils]: 97: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,948 INFO L290 TraceCheckUtils]: 96: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,949 INFO L290 TraceCheckUtils]: 95: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,949 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-07 14:34:19,949 INFO L290 TraceCheckUtils]: 93: Hoare triple {37497#true} assume !!(#t~post6 < 20);havoc #t~post6; {37497#true} is VALID [2022-04-07 14:34:19,949 INFO L290 TraceCheckUtils]: 92: Hoare triple {37497#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37497#true} is VALID [2022-04-07 14:34:19,949 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-07 14:34:19,949 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-07 14:34:19,949 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {37497#true} {37497#true} #86#return; {37497#true} is VALID [2022-04-07 14:34:19,949 INFO L290 TraceCheckUtils]: 88: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,949 INFO L290 TraceCheckUtils]: 87: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,949 INFO L290 TraceCheckUtils]: 86: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,949 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-07 14:34:19,949 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {37497#true} {37497#true} #84#return; {37497#true} is VALID [2022-04-07 14:34:19,949 INFO L290 TraceCheckUtils]: 83: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,949 INFO L290 TraceCheckUtils]: 82: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,949 INFO L290 TraceCheckUtils]: 81: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,949 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-07 14:34:19,949 INFO L290 TraceCheckUtils]: 79: Hoare triple {37497#true} assume !!(#t~post6 < 20);havoc #t~post6; {37497#true} is VALID [2022-04-07 14:34:19,949 INFO L290 TraceCheckUtils]: 78: Hoare triple {37497#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37497#true} is VALID [2022-04-07 14:34:19,950 INFO L290 TraceCheckUtils]: 77: Hoare triple {37497#true} assume !(~r~0 >= ~d~0); {37497#true} is VALID [2022-04-07 14:34:19,950 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37497#true} {37497#true} #82#return; {37497#true} is VALID [2022-04-07 14:34:19,950 INFO L290 TraceCheckUtils]: 75: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,950 INFO L290 TraceCheckUtils]: 74: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,950 INFO L290 TraceCheckUtils]: 73: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,950 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-07 14:34:19,950 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37497#true} {37497#true} #80#return; {37497#true} is VALID [2022-04-07 14:34:19,950 INFO L290 TraceCheckUtils]: 70: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,950 INFO L290 TraceCheckUtils]: 69: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,950 INFO L290 TraceCheckUtils]: 68: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,950 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-07 14:34:19,950 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {37497#true} {37497#true} #78#return; {37497#true} is VALID [2022-04-07 14:34:19,950 INFO L290 TraceCheckUtils]: 65: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,950 INFO L290 TraceCheckUtils]: 64: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,950 INFO L290 TraceCheckUtils]: 63: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,950 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-07 14:34:19,950 INFO L290 TraceCheckUtils]: 61: Hoare triple {37497#true} assume !!(#t~post5 < 20);havoc #t~post5; {37497#true} is VALID [2022-04-07 14:34:19,951 INFO L290 TraceCheckUtils]: 60: Hoare triple {37497#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37497#true} is VALID [2022-04-07 14:34:19,951 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-07 14:34:19,951 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {37497#true} {37497#true} #82#return; {37497#true} is VALID [2022-04-07 14:34:19,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,951 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-07 14:34:19,951 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37497#true} {37497#true} #80#return; {37497#true} is VALID [2022-04-07 14:34:19,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,951 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-07 14:34:19,951 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {37497#true} {37497#true} #78#return; {37497#true} is VALID [2022-04-07 14:34:19,951 INFO L290 TraceCheckUtils]: 47: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,951 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-07 14:34:19,952 INFO L290 TraceCheckUtils]: 43: Hoare triple {37497#true} assume !!(#t~post5 < 20);havoc #t~post5; {37497#true} is VALID [2022-04-07 14:34:19,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {37497#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37497#true} is VALID [2022-04-07 14:34:19,952 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-07 14:34:19,952 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {37497#true} {37497#true} #82#return; {37497#true} is VALID [2022-04-07 14:34:19,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,952 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-07 14:34:19,952 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {37497#true} {37497#true} #80#return; {37497#true} is VALID [2022-04-07 14:34:19,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,952 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-07 14:34:19,952 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {37497#true} {37497#true} #78#return; {37497#true} is VALID [2022-04-07 14:34:19,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,953 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-07 14:34:19,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {37497#true} assume !!(#t~post5 < 20);havoc #t~post5; {37497#true} is VALID [2022-04-07 14:34:19,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {37497#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37497#true} is VALID [2022-04-07 14:34:19,953 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-07 14:34:19,953 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {37497#true} {37497#true} #82#return; {37497#true} is VALID [2022-04-07 14:34:19,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,953 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-07 14:34:19,953 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37497#true} {37497#true} #80#return; {37497#true} is VALID [2022-04-07 14:34:19,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,953 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-07 14:34:19,953 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {37497#true} {37497#true} #78#return; {37497#true} is VALID [2022-04-07 14:34:19,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {37497#true} assume !(0 == ~cond); {37497#true} is VALID [2022-04-07 14:34:19,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {37497#true} ~cond := #in~cond; {37497#true} is VALID [2022-04-07 14:34:19,954 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-07 14:34:19,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {37497#true} assume !!(#t~post5 < 20);havoc #t~post5; {37497#true} is VALID [2022-04-07 14:34:19,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {37497#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37497#true} is VALID [2022-04-07 14:34:19,954 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-07 14:34:19,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {37497#true} call #t~ret7 := main(); {37497#true} is VALID [2022-04-07 14:34:19,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37497#true} {37497#true} #92#return; {37497#true} is VALID [2022-04-07 14:34:19,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {37497#true} assume true; {37497#true} is VALID [2022-04-07 14:34:19,954 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-07 14:34:19,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {37497#true} call ULTIMATE.init(); {37497#true} is VALID [2022-04-07 14:34:19,954 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-07 14:34:19,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:34:19,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658497647] [2022-04-07 14:34:19,955 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:34:19,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240223794] [2022-04-07 14:34:19,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240223794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:34:19,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:34:19,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-07 14:34:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048698642] [2022-04-07 14:34:19,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:34:19,956 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-07 14:34:19,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:34:19,956 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-07 14:34:20,005 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-07 14:34:20,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 14:34:20,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:34:20,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 14:34:20,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-07 14:34:20,006 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-07 14:34:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:34:20,833 INFO L93 Difference]: Finished difference Result 771 states and 912 transitions. [2022-04-07 14:34:20,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 14:34:20,833 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-07 14:34:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:34:20,834 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-07 14:34:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-07 14:34:20,835 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-07 14:34:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-07 14:34:20,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-07 14:34:20,886 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-07 14:34:20,907 INFO L225 Difference]: With dead ends: 771 [2022-04-07 14:34:20,908 INFO L226 Difference]: Without dead ends: 755 [2022-04-07 14:34:20,908 INFO L912 BasicCegarLoop]: 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-07 14:34:20,909 INFO L913 BasicCegarLoop]: 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-07 14:34:20,910 INFO L914 BasicCegarLoop]: 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-07 14:34:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-04-07 14:34:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 539. [2022-04-07 14:34:21,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:34:21,302 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-07 14:34:21,302 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-07 14:34:21,302 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-07 14:34:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:34:21,319 INFO L93 Difference]: Finished difference Result 755 states and 872 transitions. [2022-04-07 14:34:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 872 transitions. [2022-04-07 14:34:21,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:34:21,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:34:21,321 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-07 14:34:21,321 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-07 14:34:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:34:21,338 INFO L93 Difference]: Finished difference Result 755 states and 872 transitions. [2022-04-07 14:34:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 872 transitions. [2022-04-07 14:34:21,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:34:21,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:34:21,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:34:21,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:34:21,341 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-07 14:34:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 604 transitions. [2022-04-07 14:34:21,361 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 604 transitions. Word has length 128 [2022-04-07 14:34:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:34:21,362 INFO L478 AbstractCegarLoop]: Abstraction has 539 states and 604 transitions. [2022-04-07 14:34:21,362 INFO L479 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-07 14:34:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 604 transitions. [2022-04-07 14:34:21,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-04-07 14:34:21,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:34:21,364 INFO L499 BasicCegarLoop]: 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-07 14:34:21,382 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-07 14:34:21,575 WARN L460 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-07 14:34:21,575 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:34:21,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:34:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1492475124, now seen corresponding path program 2 times [2022-04-07 14:34:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:34:21,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779684523] [2022-04-07 14:34:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:34:21,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:34:21,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:34:21,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100861] [2022-04-07 14:34:21,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 14:34:21,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:34:21,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:34:21,599 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-07 14:34:21,600 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-07 14:34:21,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 14:34:21,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:34:21,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 14:34:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:34:21,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:34:22,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {41556#true} call ULTIMATE.init(); {41556#true} is VALID [2022-04-07 14:34:22,570 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-07 14:34:22,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {41564#(<= ~counter~0 0)} assume true; {41564#(<= ~counter~0 0)} is VALID [2022-04-07 14:34:22,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41564#(<= ~counter~0 0)} {41556#true} #92#return; {41564#(<= ~counter~0 0)} is VALID [2022-04-07 14:34:22,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {41564#(<= ~counter~0 0)} call #t~ret7 := main(); {41564#(<= ~counter~0 0)} is VALID [2022-04-07 14:34:22,571 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-07 14:34:22,572 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-07 14:34:22,572 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-07 14:34:22,572 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-07 14:34:22,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {41580#(<= ~counter~0 1)} ~cond := #in~cond; {41580#(<= ~counter~0 1)} is VALID [2022-04-07 14:34:22,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {41580#(<= ~counter~0 1)} assume !(0 == ~cond); {41580#(<= ~counter~0 1)} is VALID [2022-04-07 14:34:22,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {41580#(<= ~counter~0 1)} assume true; {41580#(<= ~counter~0 1)} is VALID [2022-04-07 14:34:22,573 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {41580#(<= ~counter~0 1)} {41580#(<= ~counter~0 1)} #78#return; {41580#(<= ~counter~0 1)} is VALID [2022-04-07 14:34:22,574 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-07 14:34:22,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {41580#(<= ~counter~0 1)} ~cond := #in~cond; {41580#(<= ~counter~0 1)} is VALID [2022-04-07 14:34:22,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {41580#(<= ~counter~0 1)} assume !(0 == ~cond); {41580#(<= ~counter~0 1)} is VALID [2022-04-07 14:34:22,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {41580#(<= ~counter~0 1)} assume true; {41580#(<= ~counter~0 1)} is VALID [2022-04-07 14:34:22,577 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {41580#(<= ~counter~0 1)} {41580#(<= ~counter~0 1)} #80#return; {41580#(<= ~counter~0 1)} is VALID [2022-04-07 14:34:22,578 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-07 14:34:22,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {41580#(<= ~counter~0 1)} ~cond := #in~cond; {41580#(<= ~counter~0 1)} is VALID [2022-04-07 14:34:22,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {41580#(<= ~counter~0 1)} assume !(0 == ~cond); {41580#(<= ~counter~0 1)} is VALID [2022-04-07 14:34:22,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {41580#(<= ~counter~0 1)} assume true; {41580#(<= ~counter~0 1)} is VALID [2022-04-07 14:34:22,579 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {41580#(<= ~counter~0 1)} {41580#(<= ~counter~0 1)} #82#return; {41580#(<= ~counter~0 1)} is VALID [2022-04-07 14:34:22,579 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-07 14:34:22,579 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-07 14:34:22,580 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-07 14:34:22,580 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-07 14:34:22,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {41635#(<= ~counter~0 2)} ~cond := #in~cond; {41635#(<= ~counter~0 2)} is VALID [2022-04-07 14:34:22,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {41635#(<= ~counter~0 2)} assume !(0 == ~cond); {41635#(<= ~counter~0 2)} is VALID [2022-04-07 14:34:22,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {41635#(<= ~counter~0 2)} assume true; {41635#(<= ~counter~0 2)} is VALID [2022-04-07 14:34:22,581 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {41635#(<= ~counter~0 2)} {41635#(<= ~counter~0 2)} #78#return; {41635#(<= ~counter~0 2)} is VALID [2022-04-07 14:34:22,581 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-07 14:34:22,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {41635#(<= ~counter~0 2)} ~cond := #in~cond; {41635#(<= ~counter~0 2)} is VALID [2022-04-07 14:34:22,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {41635#(<= ~counter~0 2)} assume !(0 == ~cond); {41635#(<= ~counter~0 2)} is VALID [2022-04-07 14:34:22,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {41635#(<= ~counter~0 2)} assume true; {41635#(<= ~counter~0 2)} is VALID [2022-04-07 14:34:22,583 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {41635#(<= ~counter~0 2)} {41635#(<= ~counter~0 2)} #80#return; {41635#(<= ~counter~0 2)} is VALID [2022-04-07 14:34:22,583 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-07 14:34:22,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {41635#(<= ~counter~0 2)} ~cond := #in~cond; {41635#(<= ~counter~0 2)} is VALID [2022-04-07 14:34:22,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {41635#(<= ~counter~0 2)} assume !(0 == ~cond); {41635#(<= ~counter~0 2)} is VALID [2022-04-07 14:34:22,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {41635#(<= ~counter~0 2)} assume true; {41635#(<= ~counter~0 2)} is VALID [2022-04-07 14:34:22,584 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {41635#(<= ~counter~0 2)} {41635#(<= ~counter~0 2)} #82#return; {41635#(<= ~counter~0 2)} is VALID [2022-04-07 14:34:22,584 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-07 14:34:22,585 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-07 14:34:22,585 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-07 14:34:22,585 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-07 14:34:22,586 INFO L290 TraceCheckUtils]: 45: Hoare triple {41690#(<= ~counter~0 3)} ~cond := #in~cond; {41690#(<= ~counter~0 3)} is VALID [2022-04-07 14:34:22,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {41690#(<= ~counter~0 3)} assume !(0 == ~cond); {41690#(<= ~counter~0 3)} is VALID [2022-04-07 14:34:22,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {41690#(<= ~counter~0 3)} assume true; {41690#(<= ~counter~0 3)} is VALID [2022-04-07 14:34:22,586 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {41690#(<= ~counter~0 3)} {41690#(<= ~counter~0 3)} #78#return; {41690#(<= ~counter~0 3)} is VALID [2022-04-07 14:34:22,587 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-07 14:34:22,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {41690#(<= ~counter~0 3)} ~cond := #in~cond; {41690#(<= ~counter~0 3)} is VALID [2022-04-07 14:34:22,587 INFO L290 TraceCheckUtils]: 51: Hoare triple {41690#(<= ~counter~0 3)} assume !(0 == ~cond); {41690#(<= ~counter~0 3)} is VALID [2022-04-07 14:34:22,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {41690#(<= ~counter~0 3)} assume true; {41690#(<= ~counter~0 3)} is VALID [2022-04-07 14:34:22,588 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {41690#(<= ~counter~0 3)} {41690#(<= ~counter~0 3)} #80#return; {41690#(<= ~counter~0 3)} is VALID [2022-04-07 14:34:22,588 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-07 14:34:22,588 INFO L290 TraceCheckUtils]: 55: Hoare triple {41690#(<= ~counter~0 3)} ~cond := #in~cond; {41690#(<= ~counter~0 3)} is VALID [2022-04-07 14:34:22,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {41690#(<= ~counter~0 3)} assume !(0 == ~cond); {41690#(<= ~counter~0 3)} is VALID [2022-04-07 14:34:22,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {41690#(<= ~counter~0 3)} assume true; {41690#(<= ~counter~0 3)} is VALID [2022-04-07 14:34:22,589 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {41690#(<= ~counter~0 3)} {41690#(<= ~counter~0 3)} #82#return; {41690#(<= ~counter~0 3)} is VALID [2022-04-07 14:34:22,590 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-07 14:34:22,590 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-07 14:34:22,590 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-07 14:34:22,591 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-07 14:34:22,591 INFO L290 TraceCheckUtils]: 63: Hoare triple {41745#(<= ~counter~0 4)} ~cond := #in~cond; {41745#(<= ~counter~0 4)} is VALID [2022-04-07 14:34:22,591 INFO L290 TraceCheckUtils]: 64: Hoare triple {41745#(<= ~counter~0 4)} assume !(0 == ~cond); {41745#(<= ~counter~0 4)} is VALID [2022-04-07 14:34:22,591 INFO L290 TraceCheckUtils]: 65: Hoare triple {41745#(<= ~counter~0 4)} assume true; {41745#(<= ~counter~0 4)} is VALID [2022-04-07 14:34:22,592 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {41745#(<= ~counter~0 4)} {41745#(<= ~counter~0 4)} #78#return; {41745#(<= ~counter~0 4)} is VALID [2022-04-07 14:34:22,592 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-07 14:34:22,592 INFO L290 TraceCheckUtils]: 68: Hoare triple {41745#(<= ~counter~0 4)} ~cond := #in~cond; {41745#(<= ~counter~0 4)} is VALID [2022-04-07 14:34:22,592 INFO L290 TraceCheckUtils]: 69: Hoare triple {41745#(<= ~counter~0 4)} assume !(0 == ~cond); {41745#(<= ~counter~0 4)} is VALID [2022-04-07 14:34:22,593 INFO L290 TraceCheckUtils]: 70: Hoare triple {41745#(<= ~counter~0 4)} assume true; {41745#(<= ~counter~0 4)} is VALID [2022-04-07 14:34:22,593 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {41745#(<= ~counter~0 4)} {41745#(<= ~counter~0 4)} #80#return; {41745#(<= ~counter~0 4)} is VALID [2022-04-07 14:34:22,593 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-07 14:34:22,594 INFO L290 TraceCheckUtils]: 73: Hoare triple {41745#(<= ~counter~0 4)} ~cond := #in~cond; {41745#(<= ~counter~0 4)} is VALID [2022-04-07 14:34:22,594 INFO L290 TraceCheckUtils]: 74: Hoare triple {41745#(<= ~counter~0 4)} assume !(0 == ~cond); {41745#(<= ~counter~0 4)} is VALID [2022-04-07 14:34:22,594 INFO L290 TraceCheckUtils]: 75: Hoare triple {41745#(<= ~counter~0 4)} assume true; {41745#(<= ~counter~0 4)} is VALID [2022-04-07 14:34:22,595 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {41745#(<= ~counter~0 4)} {41745#(<= ~counter~0 4)} #82#return; {41745#(<= ~counter~0 4)} is VALID [2022-04-07 14:34:22,595 INFO L290 TraceCheckUtils]: 77: Hoare triple {41745#(<= ~counter~0 4)} assume !(~r~0 >= ~d~0); {41745#(<= ~counter~0 4)} is VALID [2022-04-07 14:34:22,595 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-07 14:34:22,595 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-07 14:34:22,596 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-07 14:34:22,596 INFO L290 TraceCheckUtils]: 81: Hoare triple {41800#(<= ~counter~0 5)} ~cond := #in~cond; {41800#(<= ~counter~0 5)} is VALID [2022-04-07 14:34:22,596 INFO L290 TraceCheckUtils]: 82: Hoare triple {41800#(<= ~counter~0 5)} assume !(0 == ~cond); {41800#(<= ~counter~0 5)} is VALID [2022-04-07 14:34:22,597 INFO L290 TraceCheckUtils]: 83: Hoare triple {41800#(<= ~counter~0 5)} assume true; {41800#(<= ~counter~0 5)} is VALID [2022-04-07 14:34:22,597 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {41800#(<= ~counter~0 5)} {41800#(<= ~counter~0 5)} #84#return; {41800#(<= ~counter~0 5)} is VALID [2022-04-07 14:34:22,597 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-07 14:34:22,598 INFO L290 TraceCheckUtils]: 86: Hoare triple {41800#(<= ~counter~0 5)} ~cond := #in~cond; {41800#(<= ~counter~0 5)} is VALID [2022-04-07 14:34:22,598 INFO L290 TraceCheckUtils]: 87: Hoare triple {41800#(<= ~counter~0 5)} assume !(0 == ~cond); {41800#(<= ~counter~0 5)} is VALID [2022-04-07 14:34:22,598 INFO L290 TraceCheckUtils]: 88: Hoare triple {41800#(<= ~counter~0 5)} assume true; {41800#(<= ~counter~0 5)} is VALID [2022-04-07 14:34:22,599 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {41800#(<= ~counter~0 5)} {41800#(<= ~counter~0 5)} #86#return; {41800#(<= ~counter~0 5)} is VALID [2022-04-07 14:34:22,599 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-07 14:34:22,599 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-07 14:34:22,599 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-07 14:34:22,600 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-07 14:34:22,600 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-07 14:34:22,600 INFO L290 TraceCheckUtils]: 95: Hoare triple {41843#(<= ~counter~0 6)} ~cond := #in~cond; {41843#(<= ~counter~0 6)} is VALID [2022-04-07 14:34:22,601 INFO L290 TraceCheckUtils]: 96: Hoare triple {41843#(<= ~counter~0 6)} assume !(0 == ~cond); {41843#(<= ~counter~0 6)} is VALID [2022-04-07 14:34:22,601 INFO L290 TraceCheckUtils]: 97: Hoare triple {41843#(<= ~counter~0 6)} assume true; {41843#(<= ~counter~0 6)} is VALID [2022-04-07 14:34:22,601 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {41843#(<= ~counter~0 6)} {41843#(<= ~counter~0 6)} #84#return; {41843#(<= ~counter~0 6)} is VALID [2022-04-07 14:34:22,602 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-07 14:34:22,602 INFO L290 TraceCheckUtils]: 100: Hoare triple {41843#(<= ~counter~0 6)} ~cond := #in~cond; {41843#(<= ~counter~0 6)} is VALID [2022-04-07 14:34:22,602 INFO L290 TraceCheckUtils]: 101: Hoare triple {41843#(<= ~counter~0 6)} assume !(0 == ~cond); {41843#(<= ~counter~0 6)} is VALID [2022-04-07 14:34:22,603 INFO L290 TraceCheckUtils]: 102: Hoare triple {41843#(<= ~counter~0 6)} assume true; {41843#(<= ~counter~0 6)} is VALID [2022-04-07 14:34:22,603 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {41843#(<= ~counter~0 6)} {41843#(<= ~counter~0 6)} #86#return; {41843#(<= ~counter~0 6)} is VALID [2022-04-07 14:34:22,603 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-07 14:34:22,603 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-07 14:34:22,604 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-07 14:34:22,604 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-07 14:34:22,604 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-07 14:34:22,605 INFO L290 TraceCheckUtils]: 109: Hoare triple {41886#(<= ~counter~0 7)} ~cond := #in~cond; {41886#(<= ~counter~0 7)} is VALID [2022-04-07 14:34:22,605 INFO L290 TraceCheckUtils]: 110: Hoare triple {41886#(<= ~counter~0 7)} assume !(0 == ~cond); {41886#(<= ~counter~0 7)} is VALID [2022-04-07 14:34:22,605 INFO L290 TraceCheckUtils]: 111: Hoare triple {41886#(<= ~counter~0 7)} assume true; {41886#(<= ~counter~0 7)} is VALID [2022-04-07 14:34:22,606 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {41886#(<= ~counter~0 7)} {41886#(<= ~counter~0 7)} #84#return; {41886#(<= ~counter~0 7)} is VALID [2022-04-07 14:34:22,606 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-07 14:34:22,607 INFO L290 TraceCheckUtils]: 114: Hoare triple {41886#(<= ~counter~0 7)} ~cond := #in~cond; {41886#(<= ~counter~0 7)} is VALID [2022-04-07 14:34:22,607 INFO L290 TraceCheckUtils]: 115: Hoare triple {41886#(<= ~counter~0 7)} assume !(0 == ~cond); {41886#(<= ~counter~0 7)} is VALID [2022-04-07 14:34:22,607 INFO L290 TraceCheckUtils]: 116: Hoare triple {41886#(<= ~counter~0 7)} assume true; {41886#(<= ~counter~0 7)} is VALID [2022-04-07 14:34:22,607 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {41886#(<= ~counter~0 7)} {41886#(<= ~counter~0 7)} #86#return; {41886#(<= ~counter~0 7)} is VALID [2022-04-07 14:34:22,608 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-07 14:34:22,614 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-07 14:34:22,615 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-07 14:34:22,615 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-07 14:34:22,616 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-07 14:34:22,616 INFO L290 TraceCheckUtils]: 123: Hoare triple {41929#(<= ~counter~0 8)} ~cond := #in~cond; {41929#(<= ~counter~0 8)} is VALID [2022-04-07 14:34:22,616 INFO L290 TraceCheckUtils]: 124: Hoare triple {41929#(<= ~counter~0 8)} assume !(0 == ~cond); {41929#(<= ~counter~0 8)} is VALID [2022-04-07 14:34:22,616 INFO L290 TraceCheckUtils]: 125: Hoare triple {41929#(<= ~counter~0 8)} assume true; {41929#(<= ~counter~0 8)} is VALID [2022-04-07 14:34:22,617 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {41929#(<= ~counter~0 8)} {41929#(<= ~counter~0 8)} #84#return; {41929#(<= ~counter~0 8)} is VALID [2022-04-07 14:34:22,617 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-07 14:34:22,617 INFO L290 TraceCheckUtils]: 128: Hoare triple {41929#(<= ~counter~0 8)} ~cond := #in~cond; {41929#(<= ~counter~0 8)} is VALID [2022-04-07 14:34:22,618 INFO L290 TraceCheckUtils]: 129: Hoare triple {41929#(<= ~counter~0 8)} assume !(0 == ~cond); {41929#(<= ~counter~0 8)} is VALID [2022-04-07 14:34:22,618 INFO L290 TraceCheckUtils]: 130: Hoare triple {41929#(<= ~counter~0 8)} assume true; {41929#(<= ~counter~0 8)} is VALID [2022-04-07 14:34:22,618 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {41929#(<= ~counter~0 8)} {41929#(<= ~counter~0 8)} #86#return; {41929#(<= ~counter~0 8)} is VALID [2022-04-07 14:34:22,619 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-07 14:34:22,619 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-07 14:34:22,619 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-07 14:34:22,619 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-07 14:34:22,620 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-07 14:34:22,620 INFO L290 TraceCheckUtils]: 137: Hoare triple {41972#(<= ~counter~0 9)} ~cond := #in~cond; {41972#(<= ~counter~0 9)} is VALID [2022-04-07 14:34:22,620 INFO L290 TraceCheckUtils]: 138: Hoare triple {41972#(<= ~counter~0 9)} assume !(0 == ~cond); {41972#(<= ~counter~0 9)} is VALID [2022-04-07 14:34:22,621 INFO L290 TraceCheckUtils]: 139: Hoare triple {41972#(<= ~counter~0 9)} assume true; {41972#(<= ~counter~0 9)} is VALID [2022-04-07 14:34:22,621 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {41972#(<= ~counter~0 9)} {41972#(<= ~counter~0 9)} #84#return; {41972#(<= ~counter~0 9)} is VALID [2022-04-07 14:34:22,621 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-07 14:34:22,622 INFO L290 TraceCheckUtils]: 142: Hoare triple {41972#(<= ~counter~0 9)} ~cond := #in~cond; {41972#(<= ~counter~0 9)} is VALID [2022-04-07 14:34:22,622 INFO L290 TraceCheckUtils]: 143: Hoare triple {41972#(<= ~counter~0 9)} assume !(0 == ~cond); {41972#(<= ~counter~0 9)} is VALID [2022-04-07 14:34:22,622 INFO L290 TraceCheckUtils]: 144: Hoare triple {41972#(<= ~counter~0 9)} assume true; {41972#(<= ~counter~0 9)} is VALID [2022-04-07 14:34:22,623 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {41972#(<= ~counter~0 9)} {41972#(<= ~counter~0 9)} #86#return; {41972#(<= ~counter~0 9)} is VALID [2022-04-07 14:34:22,623 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-07 14:34:22,623 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-07 14:34:22,623 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-07 14:34:22,624 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-07 14:34:22,624 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-07 14:34:22,624 INFO L290 TraceCheckUtils]: 151: Hoare triple {42015#(<= ~counter~0 10)} ~cond := #in~cond; {42015#(<= ~counter~0 10)} is VALID [2022-04-07 14:34:22,625 INFO L290 TraceCheckUtils]: 152: Hoare triple {42015#(<= ~counter~0 10)} assume !(0 == ~cond); {42015#(<= ~counter~0 10)} is VALID [2022-04-07 14:34:22,625 INFO L290 TraceCheckUtils]: 153: Hoare triple {42015#(<= ~counter~0 10)} assume true; {42015#(<= ~counter~0 10)} is VALID [2022-04-07 14:34:22,625 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {42015#(<= ~counter~0 10)} {42015#(<= ~counter~0 10)} #84#return; {42015#(<= ~counter~0 10)} is VALID [2022-04-07 14:34:22,626 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-07 14:34:22,626 INFO L290 TraceCheckUtils]: 156: Hoare triple {42015#(<= ~counter~0 10)} ~cond := #in~cond; {42015#(<= ~counter~0 10)} is VALID [2022-04-07 14:34:22,626 INFO L290 TraceCheckUtils]: 157: Hoare triple {42015#(<= ~counter~0 10)} assume !(0 == ~cond); {42015#(<= ~counter~0 10)} is VALID [2022-04-07 14:34:22,626 INFO L290 TraceCheckUtils]: 158: Hoare triple {42015#(<= ~counter~0 10)} assume true; {42015#(<= ~counter~0 10)} is VALID [2022-04-07 14:34:22,627 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {42015#(<= ~counter~0 10)} {42015#(<= ~counter~0 10)} #86#return; {42015#(<= ~counter~0 10)} is VALID [2022-04-07 14:34:22,627 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-07 14:34:22,627 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-07 14:34:22,628 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-07 14:34:22,628 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-07 14:34:22,628 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-07 14:34:22,629 INFO L290 TraceCheckUtils]: 165: Hoare triple {42058#(<= ~counter~0 11)} ~cond := #in~cond; {42058#(<= ~counter~0 11)} is VALID [2022-04-07 14:34:22,629 INFO L290 TraceCheckUtils]: 166: Hoare triple {42058#(<= ~counter~0 11)} assume !(0 == ~cond); {42058#(<= ~counter~0 11)} is VALID [2022-04-07 14:34:22,629 INFO L290 TraceCheckUtils]: 167: Hoare triple {42058#(<= ~counter~0 11)} assume true; {42058#(<= ~counter~0 11)} is VALID [2022-04-07 14:34:22,630 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {42058#(<= ~counter~0 11)} {42058#(<= ~counter~0 11)} #84#return; {42058#(<= ~counter~0 11)} is VALID [2022-04-07 14:34:22,630 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-07 14:34:22,630 INFO L290 TraceCheckUtils]: 170: Hoare triple {42058#(<= ~counter~0 11)} ~cond := #in~cond; {42058#(<= ~counter~0 11)} is VALID [2022-04-07 14:34:22,631 INFO L290 TraceCheckUtils]: 171: Hoare triple {42058#(<= ~counter~0 11)} assume !(0 == ~cond); {42058#(<= ~counter~0 11)} is VALID [2022-04-07 14:34:22,631 INFO L290 TraceCheckUtils]: 172: Hoare triple {42058#(<= ~counter~0 11)} assume true; {42058#(<= ~counter~0 11)} is VALID [2022-04-07 14:34:22,631 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {42058#(<= ~counter~0 11)} {42058#(<= ~counter~0 11)} #86#return; {42058#(<= ~counter~0 11)} is VALID [2022-04-07 14:34:22,631 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-07 14:34:22,632 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-07 14:34:22,632 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-07 14:34:22,632 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-07 14:34:22,633 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-07 14:34:22,633 INFO L290 TraceCheckUtils]: 179: Hoare triple {42101#(<= ~counter~0 12)} ~cond := #in~cond; {42101#(<= ~counter~0 12)} is VALID [2022-04-07 14:34:22,633 INFO L290 TraceCheckUtils]: 180: Hoare triple {42101#(<= ~counter~0 12)} assume !(0 == ~cond); {42101#(<= ~counter~0 12)} is VALID [2022-04-07 14:34:22,634 INFO L290 TraceCheckUtils]: 181: Hoare triple {42101#(<= ~counter~0 12)} assume true; {42101#(<= ~counter~0 12)} is VALID [2022-04-07 14:34:22,634 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {42101#(<= ~counter~0 12)} {42101#(<= ~counter~0 12)} #84#return; {42101#(<= ~counter~0 12)} is VALID [2022-04-07 14:34:22,634 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-07 14:34:22,635 INFO L290 TraceCheckUtils]: 184: Hoare triple {42101#(<= ~counter~0 12)} ~cond := #in~cond; {42101#(<= ~counter~0 12)} is VALID [2022-04-07 14:34:22,635 INFO L290 TraceCheckUtils]: 185: Hoare triple {42101#(<= ~counter~0 12)} assume !(0 == ~cond); {42101#(<= ~counter~0 12)} is VALID [2022-04-07 14:34:22,635 INFO L290 TraceCheckUtils]: 186: Hoare triple {42101#(<= ~counter~0 12)} assume true; {42101#(<= ~counter~0 12)} is VALID [2022-04-07 14:34:22,635 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {42101#(<= ~counter~0 12)} {42101#(<= ~counter~0 12)} #86#return; {42101#(<= ~counter~0 12)} is VALID [2022-04-07 14:34:22,636 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-07 14:34:22,636 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-07 14:34:22,636 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-07 14:34:22,637 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-07 14:34:22,637 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-07 14:34:22,637 INFO L290 TraceCheckUtils]: 193: Hoare triple {42144#(<= ~counter~0 13)} ~cond := #in~cond; {42144#(<= ~counter~0 13)} is VALID [2022-04-07 14:34:22,638 INFO L290 TraceCheckUtils]: 194: Hoare triple {42144#(<= ~counter~0 13)} assume !(0 == ~cond); {42144#(<= ~counter~0 13)} is VALID [2022-04-07 14:34:22,638 INFO L290 TraceCheckUtils]: 195: Hoare triple {42144#(<= ~counter~0 13)} assume true; {42144#(<= ~counter~0 13)} is VALID [2022-04-07 14:34:22,638 INFO L284 TraceCheckUtils]: 196: Hoare quadruple {42144#(<= ~counter~0 13)} {42144#(<= ~counter~0 13)} #84#return; {42144#(<= ~counter~0 13)} is VALID [2022-04-07 14:34:22,639 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-07 14:34:22,639 INFO L290 TraceCheckUtils]: 198: Hoare triple {42144#(<= ~counter~0 13)} ~cond := #in~cond; {42144#(<= ~counter~0 13)} is VALID [2022-04-07 14:34:22,639 INFO L290 TraceCheckUtils]: 199: Hoare triple {42144#(<= ~counter~0 13)} assume !(0 == ~cond); {42144#(<= ~counter~0 13)} is VALID [2022-04-07 14:34:22,639 INFO L290 TraceCheckUtils]: 200: Hoare triple {42144#(<= ~counter~0 13)} assume true; {42144#(<= ~counter~0 13)} is VALID [2022-04-07 14:34:22,640 INFO L284 TraceCheckUtils]: 201: Hoare quadruple {42144#(<= ~counter~0 13)} {42144#(<= ~counter~0 13)} #86#return; {42144#(<= ~counter~0 13)} is VALID [2022-04-07 14:34:22,640 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-07 14:34:22,640 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-07 14:34:22,641 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-07 14:34:22,641 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-07 14:34:22,641 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-07 14:34:22,642 INFO L290 TraceCheckUtils]: 207: Hoare triple {42187#(<= ~counter~0 14)} ~cond := #in~cond; {42187#(<= ~counter~0 14)} is VALID [2022-04-07 14:34:22,642 INFO L290 TraceCheckUtils]: 208: Hoare triple {42187#(<= ~counter~0 14)} assume !(0 == ~cond); {42187#(<= ~counter~0 14)} is VALID [2022-04-07 14:34:22,642 INFO L290 TraceCheckUtils]: 209: Hoare triple {42187#(<= ~counter~0 14)} assume true; {42187#(<= ~counter~0 14)} is VALID [2022-04-07 14:34:22,643 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {42187#(<= ~counter~0 14)} {42187#(<= ~counter~0 14)} #84#return; {42187#(<= ~counter~0 14)} is VALID [2022-04-07 14:34:22,643 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-07 14:34:22,643 INFO L290 TraceCheckUtils]: 212: Hoare triple {42187#(<= ~counter~0 14)} ~cond := #in~cond; {42187#(<= ~counter~0 14)} is VALID [2022-04-07 14:34:22,643 INFO L290 TraceCheckUtils]: 213: Hoare triple {42187#(<= ~counter~0 14)} assume !(0 == ~cond); {42187#(<= ~counter~0 14)} is VALID [2022-04-07 14:34:22,644 INFO L290 TraceCheckUtils]: 214: Hoare triple {42187#(<= ~counter~0 14)} assume true; {42187#(<= ~counter~0 14)} is VALID [2022-04-07 14:34:22,644 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {42187#(<= ~counter~0 14)} {42187#(<= ~counter~0 14)} #86#return; {42187#(<= ~counter~0 14)} is VALID [2022-04-07 14:34:22,644 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-07 14:34:22,645 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-07 14:34:22,645 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-07 14:34:22,645 INFO L290 TraceCheckUtils]: 219: Hoare triple {42230#(<= |main_#t~post6| 14)} assume !(#t~post6 < 20);havoc #t~post6; {41557#false} is VALID [2022-04-07 14:34:22,645 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-07 14:34:22,645 INFO L290 TraceCheckUtils]: 221: Hoare triple {41557#false} ~cond := #in~cond; {41557#false} is VALID [2022-04-07 14:34:22,645 INFO L290 TraceCheckUtils]: 222: Hoare triple {41557#false} assume 0 == ~cond; {41557#false} is VALID [2022-04-07 14:34:22,645 INFO L290 TraceCheckUtils]: 223: Hoare triple {41557#false} assume !false; {41557#false} is VALID [2022-04-07 14:34:22,646 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-07 14:34:22,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:34:23,455 INFO L290 TraceCheckUtils]: 223: Hoare triple {41557#false} assume !false; {41557#false} is VALID [2022-04-07 14:34:23,456 INFO L290 TraceCheckUtils]: 222: Hoare triple {41557#false} assume 0 == ~cond; {41557#false} is VALID [2022-04-07 14:34:23,456 INFO L290 TraceCheckUtils]: 221: Hoare triple {41557#false} ~cond := #in~cond; {41557#false} is VALID [2022-04-07 14:34:23,456 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-07 14:34:23,456 INFO L290 TraceCheckUtils]: 219: Hoare triple {42258#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {41557#false} is VALID [2022-04-07 14:34:23,456 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-07 14:34:23,457 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-07 14:34:23,457 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-07 14:34:23,457 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {41556#true} {42262#(< ~counter~0 20)} #86#return; {42262#(< ~counter~0 20)} is VALID [2022-04-07 14:34:23,457 INFO L290 TraceCheckUtils]: 214: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,457 INFO L290 TraceCheckUtils]: 213: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,457 INFO L290 TraceCheckUtils]: 212: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,458 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-07 14:34:23,458 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {41556#true} {42262#(< ~counter~0 20)} #84#return; {42262#(< ~counter~0 20)} is VALID [2022-04-07 14:34:23,458 INFO L290 TraceCheckUtils]: 209: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,458 INFO L290 TraceCheckUtils]: 208: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,458 INFO L290 TraceCheckUtils]: 207: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,458 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-07 14:34:23,458 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-07 14:34:23,459 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-07 14:34:23,459 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-07 14:34:23,460 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-07 14:34:23,460 INFO L284 TraceCheckUtils]: 201: Hoare quadruple {41556#true} {42305#(< ~counter~0 19)} #86#return; {42305#(< ~counter~0 19)} is VALID [2022-04-07 14:34:23,460 INFO L290 TraceCheckUtils]: 200: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,460 INFO L290 TraceCheckUtils]: 199: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,460 INFO L290 TraceCheckUtils]: 198: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,460 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-07 14:34:23,461 INFO L284 TraceCheckUtils]: 196: Hoare quadruple {41556#true} {42305#(< ~counter~0 19)} #84#return; {42305#(< ~counter~0 19)} is VALID [2022-04-07 14:34:23,461 INFO L290 TraceCheckUtils]: 195: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,461 INFO L290 TraceCheckUtils]: 194: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,461 INFO L290 TraceCheckUtils]: 193: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,461 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-07 14:34:23,461 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-07 14:34:23,462 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-07 14:34:23,462 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-07 14:34:23,462 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-07 14:34:23,463 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {41556#true} {42348#(< ~counter~0 18)} #86#return; {42348#(< ~counter~0 18)} is VALID [2022-04-07 14:34:23,463 INFO L290 TraceCheckUtils]: 186: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,463 INFO L290 TraceCheckUtils]: 185: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,463 INFO L290 TraceCheckUtils]: 184: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,463 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-07 14:34:23,463 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {41556#true} {42348#(< ~counter~0 18)} #84#return; {42348#(< ~counter~0 18)} is VALID [2022-04-07 14:34:23,463 INFO L290 TraceCheckUtils]: 181: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,463 INFO L290 TraceCheckUtils]: 180: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,463 INFO L290 TraceCheckUtils]: 179: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,463 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-07 14:34:23,464 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-07 14:34:23,464 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-07 14:34:23,464 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-07 14:34:23,465 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-07 14:34:23,465 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {41556#true} {42391#(< ~counter~0 17)} #86#return; {42391#(< ~counter~0 17)} is VALID [2022-04-07 14:34:23,465 INFO L290 TraceCheckUtils]: 172: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,465 INFO L290 TraceCheckUtils]: 171: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,465 INFO L290 TraceCheckUtils]: 170: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,465 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-07 14:34:23,466 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {41556#true} {42391#(< ~counter~0 17)} #84#return; {42391#(< ~counter~0 17)} is VALID [2022-04-07 14:34:23,466 INFO L290 TraceCheckUtils]: 167: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,466 INFO L290 TraceCheckUtils]: 166: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,466 INFO L290 TraceCheckUtils]: 165: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,466 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-07 14:34:23,466 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-07 14:34:23,467 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-07 14:34:23,483 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-07 14:34:23,483 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-07 14:34:23,484 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {41556#true} {42434#(< ~counter~0 16)} #86#return; {42434#(< ~counter~0 16)} is VALID [2022-04-07 14:34:23,484 INFO L290 TraceCheckUtils]: 158: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,484 INFO L290 TraceCheckUtils]: 157: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,484 INFO L290 TraceCheckUtils]: 156: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,484 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-07 14:34:23,485 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {41556#true} {42434#(< ~counter~0 16)} #84#return; {42434#(< ~counter~0 16)} is VALID [2022-04-07 14:34:23,485 INFO L290 TraceCheckUtils]: 153: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,485 INFO L290 TraceCheckUtils]: 152: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,485 INFO L290 TraceCheckUtils]: 151: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,485 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-07 14:34:23,485 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-07 14:34:23,486 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-07 14:34:23,486 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-07 14:34:23,486 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-07 14:34:23,487 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {41556#true} {42187#(<= ~counter~0 14)} #86#return; {42187#(<= ~counter~0 14)} is VALID [2022-04-07 14:34:23,487 INFO L290 TraceCheckUtils]: 144: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,487 INFO L290 TraceCheckUtils]: 143: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,487 INFO L290 TraceCheckUtils]: 142: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,487 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-07 14:34:23,487 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {41556#true} {42187#(<= ~counter~0 14)} #84#return; {42187#(<= ~counter~0 14)} is VALID [2022-04-07 14:34:23,488 INFO L290 TraceCheckUtils]: 139: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,488 INFO L290 TraceCheckUtils]: 138: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,488 INFO L290 TraceCheckUtils]: 137: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,488 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-07 14:34:23,488 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-07 14:34:23,488 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-07 14:34:23,489 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-07 14:34:23,489 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-07 14:34:23,489 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {41556#true} {42144#(<= ~counter~0 13)} #86#return; {42144#(<= ~counter~0 13)} is VALID [2022-04-07 14:34:23,489 INFO L290 TraceCheckUtils]: 130: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,490 INFO L290 TraceCheckUtils]: 129: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,490 INFO L290 TraceCheckUtils]: 128: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,490 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-07 14:34:23,490 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {41556#true} {42144#(<= ~counter~0 13)} #84#return; {42144#(<= ~counter~0 13)} is VALID [2022-04-07 14:34:23,490 INFO L290 TraceCheckUtils]: 125: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,490 INFO L290 TraceCheckUtils]: 124: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,490 INFO L290 TraceCheckUtils]: 123: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,490 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-07 14:34:23,491 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-07 14:34:23,491 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-07 14:34:23,491 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-07 14:34:23,492 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-07 14:34:23,492 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {41556#true} {42101#(<= ~counter~0 12)} #86#return; {42101#(<= ~counter~0 12)} is VALID [2022-04-07 14:34:23,492 INFO L290 TraceCheckUtils]: 116: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,492 INFO L290 TraceCheckUtils]: 115: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,492 INFO L290 TraceCheckUtils]: 114: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,492 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-07 14:34:23,493 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {41556#true} {42101#(<= ~counter~0 12)} #84#return; {42101#(<= ~counter~0 12)} is VALID [2022-04-07 14:34:23,493 INFO L290 TraceCheckUtils]: 111: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,493 INFO L290 TraceCheckUtils]: 110: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,493 INFO L290 TraceCheckUtils]: 109: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,493 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-07 14:34:23,493 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-07 14:34:23,494 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-07 14:34:23,494 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-07 14:34:23,494 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-07 14:34:23,494 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {41556#true} {42058#(<= ~counter~0 11)} #86#return; {42058#(<= ~counter~0 11)} is VALID [2022-04-07 14:34:23,494 INFO L290 TraceCheckUtils]: 102: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,495 INFO L290 TraceCheckUtils]: 101: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,495 INFO L290 TraceCheckUtils]: 100: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,495 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-07 14:34:23,495 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {41556#true} {42058#(<= ~counter~0 11)} #84#return; {42058#(<= ~counter~0 11)} is VALID [2022-04-07 14:34:23,495 INFO L290 TraceCheckUtils]: 97: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,495 INFO L290 TraceCheckUtils]: 96: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,495 INFO L290 TraceCheckUtils]: 95: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,495 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-07 14:34:23,496 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-07 14:34:23,496 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-07 14:34:23,496 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-07 14:34:23,496 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-07 14:34:23,497 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {41556#true} {42015#(<= ~counter~0 10)} #86#return; {42015#(<= ~counter~0 10)} is VALID [2022-04-07 14:34:23,497 INFO L290 TraceCheckUtils]: 88: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,497 INFO L290 TraceCheckUtils]: 87: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,497 INFO L290 TraceCheckUtils]: 86: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,497 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-07 14:34:23,498 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {41556#true} {42015#(<= ~counter~0 10)} #84#return; {42015#(<= ~counter~0 10)} is VALID [2022-04-07 14:34:23,498 INFO L290 TraceCheckUtils]: 83: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,498 INFO L290 TraceCheckUtils]: 82: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,498 INFO L290 TraceCheckUtils]: 81: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,498 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-07 14:34:23,498 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-07 14:34:23,499 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-07 14:34:23,499 INFO L290 TraceCheckUtils]: 77: Hoare triple {41972#(<= ~counter~0 9)} assume !(~r~0 >= ~d~0); {41972#(<= ~counter~0 9)} is VALID [2022-04-07 14:34:23,499 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {41556#true} {41972#(<= ~counter~0 9)} #82#return; {41972#(<= ~counter~0 9)} is VALID [2022-04-07 14:34:23,499 INFO L290 TraceCheckUtils]: 75: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,499 INFO L290 TraceCheckUtils]: 74: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,499 INFO L290 TraceCheckUtils]: 73: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,499 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-07 14:34:23,500 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {41556#true} {41972#(<= ~counter~0 9)} #80#return; {41972#(<= ~counter~0 9)} is VALID [2022-04-07 14:34:23,500 INFO L290 TraceCheckUtils]: 70: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,500 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-07 14:34:23,500 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {41556#true} {41972#(<= ~counter~0 9)} #78#return; {41972#(<= ~counter~0 9)} is VALID [2022-04-07 14:34:23,500 INFO L290 TraceCheckUtils]: 65: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,501 INFO L290 TraceCheckUtils]: 64: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,501 INFO L290 TraceCheckUtils]: 63: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,501 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-07 14:34:23,501 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-07 14:34:23,501 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-07 14:34:23,502 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-07 14:34:23,502 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {41556#true} {41929#(<= ~counter~0 8)} #82#return; {41929#(<= ~counter~0 8)} is VALID [2022-04-07 14:34:23,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,502 INFO L290 TraceCheckUtils]: 55: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,502 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-07 14:34:23,503 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {41556#true} {41929#(<= ~counter~0 8)} #80#return; {41929#(<= ~counter~0 8)} is VALID [2022-04-07 14:34:23,503 INFO L290 TraceCheckUtils]: 52: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,503 INFO L290 TraceCheckUtils]: 51: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,503 INFO L290 TraceCheckUtils]: 50: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,503 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-07 14:34:23,503 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {41556#true} {41929#(<= ~counter~0 8)} #78#return; {41929#(<= ~counter~0 8)} is VALID [2022-04-07 14:34:23,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,503 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-07 14:34:23,504 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-07 14:34:23,504 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-07 14:34:23,504 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-07 14:34:23,505 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {41556#true} {41886#(<= ~counter~0 7)} #82#return; {41886#(<= ~counter~0 7)} is VALID [2022-04-07 14:34:23,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,505 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-07 14:34:23,505 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {41556#true} {41886#(<= ~counter~0 7)} #80#return; {41886#(<= ~counter~0 7)} is VALID [2022-04-07 14:34:23,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,507 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-07 14:34:23,508 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {41556#true} {41886#(<= ~counter~0 7)} #78#return; {41886#(<= ~counter~0 7)} is VALID [2022-04-07 14:34:23,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,508 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-07 14:34:23,508 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-07 14:34:23,508 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-07 14:34:23,509 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-07 14:34:23,509 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {41556#true} {41843#(<= ~counter~0 6)} #82#return; {41843#(<= ~counter~0 6)} is VALID [2022-04-07 14:34:23,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,509 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-07 14:34:23,510 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {41556#true} {41843#(<= ~counter~0 6)} #80#return; {41843#(<= ~counter~0 6)} is VALID [2022-04-07 14:34:23,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,510 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-07 14:34:23,510 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {41556#true} {41843#(<= ~counter~0 6)} #78#return; {41843#(<= ~counter~0 6)} is VALID [2022-04-07 14:34:23,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {41556#true} assume true; {41556#true} is VALID [2022-04-07 14:34:23,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {41556#true} assume !(0 == ~cond); {41556#true} is VALID [2022-04-07 14:34:23,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {41556#true} ~cond := #in~cond; {41556#true} is VALID [2022-04-07 14:34:23,511 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-07 14:34:23,511 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-07 14:34:23,511 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-07 14:34:23,512 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-07 14:34:23,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {41800#(<= ~counter~0 5)} call #t~ret7 := main(); {41800#(<= ~counter~0 5)} is VALID [2022-04-07 14:34:23,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41800#(<= ~counter~0 5)} {41556#true} #92#return; {41800#(<= ~counter~0 5)} is VALID [2022-04-07 14:34:23,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {41800#(<= ~counter~0 5)} assume true; {41800#(<= ~counter~0 5)} is VALID [2022-04-07 14:34:23,513 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-07 14:34:23,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {41556#true} call ULTIMATE.init(); {41556#true} is VALID [2022-04-07 14:34:23,514 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-07 14:34:23,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:34:23,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779684523] [2022-04-07 14:34:23,514 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:34:23,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100861] [2022-04-07 14:34:23,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:34:23,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:34:23,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-07 14:34:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830255093] [2022-04-07 14:34:23,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:34:23,515 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-07 14:34:23,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:34:23,581 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-07 14:34:23,776 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-07 14:34:23,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-07 14:34:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:34:23,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-07 14:34:23,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-07 14:34:23,777 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-07 14:34:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:34:26,404 INFO L93 Difference]: Finished difference Result 829 states and 954 transitions. [2022-04-07 14:34:26,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-07 14:34:26,404 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-07 14:34:26,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:34:26,404 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-07 14:34:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 440 transitions. [2022-04-07 14:34:26,410 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-07 14:34:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 440 transitions. [2022-04-07 14:34:26,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 440 transitions. [2022-04-07 14:34:26,740 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-07 14:34:26,765 INFO L225 Difference]: With dead ends: 829 [2022-04-07 14:34:26,765 INFO L226 Difference]: Without dead ends: 816 [2022-04-07 14:34:26,765 INFO L912 BasicCegarLoop]: 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-07 14:34:26,766 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 548 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-07 14:34:26,766 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 463 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-07 14:34:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2022-04-07 14:34:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 815. [2022-04-07 14:34:27,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:34:27,411 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-07 14:34:27,412 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-07 14:34:27,413 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-07 14:34:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:34:27,432 INFO L93 Difference]: Finished difference Result 816 states and 923 transitions. [2022-04-07 14:34:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 923 transitions. [2022-04-07 14:34:27,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:34:27,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:34:27,435 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-07 14:34:27,435 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-07 14:34:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:34:27,455 INFO L93 Difference]: Finished difference Result 816 states and 923 transitions. [2022-04-07 14:34:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 923 transitions. [2022-04-07 14:34:27,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:34:27,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:34:27,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:34:27,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:34:27,457 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-07 14:34:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 922 transitions. [2022-04-07 14:34:27,482 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 922 transitions. Word has length 224 [2022-04-07 14:34:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:34:27,482 INFO L478 AbstractCegarLoop]: Abstraction has 815 states and 922 transitions. [2022-04-07 14:34:27,482 INFO L479 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-07 14:34:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 922 transitions. [2022-04-07 14:34:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-04-07 14:34:27,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:34:27,485 INFO L499 BasicCegarLoop]: 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-07 14:34:27,502 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-07 14:34:27,699 WARN L460 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-07 14:34:27,699 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:34:27,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:34:27,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1873636372, now seen corresponding path program 3 times [2022-04-07 14:34:27,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:34:27,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336870273] [2022-04-07 14:34:27,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:34:27,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:34:27,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:34:27,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [626081694] [2022-04-07 14:34:27,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 14:34:27,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:34:27,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:34:27,725 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-07 14:34:27,726 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-07 14:34:28,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2022-04-07 14:34:28,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:34:28,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-07 14:34:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:34:28,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:34:28,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {46809#true} call ULTIMATE.init(); {46809#true} is VALID [2022-04-07 14:34:28,615 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-07 14:34:28,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46809#true} {46809#true} #92#return; {46809#true} is VALID [2022-04-07 14:34:28,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {46809#true} call #t~ret7 := main(); {46809#true} is VALID [2022-04-07 14:34:28,616 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-07 14:34:28,616 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-07 14:34:28,616 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-07 14:34:28,616 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-07 14:34:28,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,617 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #78#return; {46829#(= main_~p~0 1)} is VALID [2022-04-07 14:34:28,617 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-07 14:34:28,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,617 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #80#return; {46829#(= main_~p~0 1)} is VALID [2022-04-07 14:34:28,617 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-07 14:34:28,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,618 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #82#return; {46829#(= main_~p~0 1)} is VALID [2022-04-07 14:34:28,618 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-07 14:34:28,618 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-07 14:34:28,619 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-07 14:34:28,619 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-07 14:34:28,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,619 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {46809#true} {46884#(= main_~p~0 2)} #78#return; {46884#(= main_~p~0 2)} is VALID [2022-04-07 14:34:28,619 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-07 14:34:28,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,620 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {46809#true} {46884#(= main_~p~0 2)} #80#return; {46884#(= main_~p~0 2)} is VALID [2022-04-07 14:34:28,620 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-07 14:34:28,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,620 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {46809#true} {46884#(= main_~p~0 2)} #82#return; {46884#(= main_~p~0 2)} is VALID [2022-04-07 14:34:28,621 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-07 14:34:28,621 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-07 14:34:28,621 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-07 14:34:28,621 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-07 14:34:28,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,622 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {46809#true} {46939#(= main_~p~0 4)} #78#return; {46939#(= main_~p~0 4)} is VALID [2022-04-07 14:34:28,622 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-07 14:34:28,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,622 INFO L290 TraceCheckUtils]: 52: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,622 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {46809#true} {46939#(= main_~p~0 4)} #80#return; {46939#(= main_~p~0 4)} is VALID [2022-04-07 14:34:28,622 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-07 14:34:28,622 INFO L290 TraceCheckUtils]: 55: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,622 INFO L290 TraceCheckUtils]: 57: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,623 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {46809#true} {46939#(= main_~p~0 4)} #82#return; {46939#(= main_~p~0 4)} is VALID [2022-04-07 14:34:28,623 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-07 14:34:28,623 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-07 14:34:28,623 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-07 14:34:28,624 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-07 14:34:28,624 INFO L290 TraceCheckUtils]: 63: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,624 INFO L290 TraceCheckUtils]: 64: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,624 INFO L290 TraceCheckUtils]: 65: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,624 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {46809#true} {46994#(= main_~p~0 8)} #78#return; {46994#(= main_~p~0 8)} is VALID [2022-04-07 14:34:28,624 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-07 14:34:28,624 INFO L290 TraceCheckUtils]: 68: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,624 INFO L290 TraceCheckUtils]: 69: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,624 INFO L290 TraceCheckUtils]: 70: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,625 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {46809#true} {46994#(= main_~p~0 8)} #80#return; {46994#(= main_~p~0 8)} is VALID [2022-04-07 14:34:28,625 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-07 14:34:28,625 INFO L290 TraceCheckUtils]: 73: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,625 INFO L290 TraceCheckUtils]: 74: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,625 INFO L290 TraceCheckUtils]: 75: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,625 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {46809#true} {46994#(= main_~p~0 8)} #82#return; {46994#(= main_~p~0 8)} is VALID [2022-04-07 14:34:28,625 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-07 14:34:28,626 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-07 14:34:28,626 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-07 14:34:28,626 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-07 14:34:28,626 INFO L290 TraceCheckUtils]: 81: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,626 INFO L290 TraceCheckUtils]: 82: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,626 INFO L290 TraceCheckUtils]: 83: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,626 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {46809#true} {46994#(= main_~p~0 8)} #84#return; {46994#(= main_~p~0 8)} is VALID [2022-04-07 14:34:28,626 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-07 14:34:28,626 INFO L290 TraceCheckUtils]: 86: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,627 INFO L290 TraceCheckUtils]: 87: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,627 INFO L290 TraceCheckUtils]: 88: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,627 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {46809#true} {46994#(= main_~p~0 8)} #86#return; {46994#(= main_~p~0 8)} is VALID [2022-04-07 14:34:28,627 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-07 14:34:28,627 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-07 14:34:28,628 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-07 14:34:28,628 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-07 14:34:28,628 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-07 14:34:28,628 INFO L290 TraceCheckUtils]: 95: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,628 INFO L290 TraceCheckUtils]: 96: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,628 INFO L290 TraceCheckUtils]: 97: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,629 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {46809#true} {46939#(= main_~p~0 4)} #84#return; {46939#(= main_~p~0 4)} is VALID [2022-04-07 14:34:28,629 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-07 14:34:28,629 INFO L290 TraceCheckUtils]: 100: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,629 INFO L290 TraceCheckUtils]: 101: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,629 INFO L290 TraceCheckUtils]: 102: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,629 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {46809#true} {46939#(= main_~p~0 4)} #86#return; {46939#(= main_~p~0 4)} is VALID [2022-04-07 14:34:28,629 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-07 14:34:28,630 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-07 14:34:28,630 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-07 14:34:28,630 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-07 14:34:28,630 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-07 14:34:28,630 INFO L290 TraceCheckUtils]: 109: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,630 INFO L290 TraceCheckUtils]: 110: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,630 INFO L290 TraceCheckUtils]: 111: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,631 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {46809#true} {46884#(= main_~p~0 2)} #84#return; {46884#(= main_~p~0 2)} is VALID [2022-04-07 14:34:28,631 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-07 14:34:28,631 INFO L290 TraceCheckUtils]: 114: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,631 INFO L290 TraceCheckUtils]: 115: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,631 INFO L290 TraceCheckUtils]: 116: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,631 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {46809#true} {46884#(= main_~p~0 2)} #86#return; {46884#(= main_~p~0 2)} is VALID [2022-04-07 14:34:28,632 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-07 14:34:28,632 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-07 14:34:28,632 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-07 14:34:28,632 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-07 14:34:28,632 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-07 14:34:28,632 INFO L290 TraceCheckUtils]: 123: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,633 INFO L290 TraceCheckUtils]: 124: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,633 INFO L290 TraceCheckUtils]: 125: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,633 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #84#return; {46829#(= main_~p~0 1)} is VALID [2022-04-07 14:34:28,633 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-07 14:34:28,633 INFO L290 TraceCheckUtils]: 128: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:28,633 INFO L290 TraceCheckUtils]: 129: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:28,633 INFO L290 TraceCheckUtils]: 130: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:28,633 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #86#return; {46829#(= main_~p~0 1)} is VALID [2022-04-07 14:34:28,634 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-07 14:34:28,634 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-07 14:34:28,634 INFO L290 TraceCheckUtils]: 134: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,634 INFO L290 TraceCheckUtils]: 135: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,634 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-07 14:34:28,634 INFO L290 TraceCheckUtils]: 137: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,634 INFO L290 TraceCheckUtils]: 138: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,634 INFO L290 TraceCheckUtils]: 139: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,634 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:28,634 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-07 14:34:28,634 INFO L290 TraceCheckUtils]: 142: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,634 INFO L290 TraceCheckUtils]: 143: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,634 INFO L290 TraceCheckUtils]: 144: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,634 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:28,635 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-07 14:34:28,635 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-07 14:34:28,635 INFO L290 TraceCheckUtils]: 148: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,635 INFO L290 TraceCheckUtils]: 149: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,635 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-07 14:34:28,635 INFO L290 TraceCheckUtils]: 151: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,635 INFO L290 TraceCheckUtils]: 152: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,635 INFO L290 TraceCheckUtils]: 153: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,635 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:28,635 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-07 14:34:28,635 INFO L290 TraceCheckUtils]: 156: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,635 INFO L290 TraceCheckUtils]: 157: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,635 INFO L290 TraceCheckUtils]: 158: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,635 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:28,635 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-07 14:34:28,635 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-07 14:34:28,636 INFO L290 TraceCheckUtils]: 162: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,636 INFO L290 TraceCheckUtils]: 163: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,636 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-07 14:34:28,636 INFO L290 TraceCheckUtils]: 165: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,636 INFO L290 TraceCheckUtils]: 166: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,636 INFO L290 TraceCheckUtils]: 167: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,636 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:28,636 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-07 14:34:28,636 INFO L290 TraceCheckUtils]: 170: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,636 INFO L290 TraceCheckUtils]: 171: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,636 INFO L290 TraceCheckUtils]: 172: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,636 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:28,636 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-07 14:34:28,636 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-07 14:34:28,636 INFO L290 TraceCheckUtils]: 176: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,636 INFO L290 TraceCheckUtils]: 177: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,636 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-07 14:34:28,637 INFO L290 TraceCheckUtils]: 179: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,637 INFO L290 TraceCheckUtils]: 180: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,637 INFO L290 TraceCheckUtils]: 181: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,637 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:28,637 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-07 14:34:28,637 INFO L290 TraceCheckUtils]: 184: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,637 INFO L290 TraceCheckUtils]: 185: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,637 INFO L290 TraceCheckUtils]: 186: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,637 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:28,637 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-07 14:34:28,637 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-07 14:34:28,637 INFO L290 TraceCheckUtils]: 190: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,637 INFO L290 TraceCheckUtils]: 191: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,637 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-07 14:34:28,637 INFO L290 TraceCheckUtils]: 193: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,637 INFO L290 TraceCheckUtils]: 194: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,637 INFO L290 TraceCheckUtils]: 195: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,638 INFO L284 TraceCheckUtils]: 196: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:28,638 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-07 14:34:28,638 INFO L290 TraceCheckUtils]: 198: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,638 INFO L290 TraceCheckUtils]: 199: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,638 INFO L290 TraceCheckUtils]: 200: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,638 INFO L284 TraceCheckUtils]: 201: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:28,638 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-07 14:34:28,638 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-07 14:34:28,638 INFO L290 TraceCheckUtils]: 204: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,638 INFO L290 TraceCheckUtils]: 205: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,638 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-07 14:34:28,638 INFO L290 TraceCheckUtils]: 207: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,638 INFO L290 TraceCheckUtils]: 208: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,638 INFO L290 TraceCheckUtils]: 209: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,638 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:28,638 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-07 14:34:28,638 INFO L290 TraceCheckUtils]: 212: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,638 INFO L290 TraceCheckUtils]: 213: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,639 INFO L290 TraceCheckUtils]: 214: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,639 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:28,639 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-07 14:34:28,639 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-07 14:34:28,639 INFO L290 TraceCheckUtils]: 218: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,639 INFO L290 TraceCheckUtils]: 219: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,639 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-07 14:34:28,639 INFO L290 TraceCheckUtils]: 221: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,639 INFO L290 TraceCheckUtils]: 222: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,639 INFO L290 TraceCheckUtils]: 223: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,639 INFO L284 TraceCheckUtils]: 224: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:28,639 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-07 14:34:28,639 INFO L290 TraceCheckUtils]: 226: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,639 INFO L290 TraceCheckUtils]: 227: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,639 INFO L290 TraceCheckUtils]: 228: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,639 INFO L284 TraceCheckUtils]: 229: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:28,639 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-07 14:34:28,640 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-07 14:34:28,640 INFO L290 TraceCheckUtils]: 232: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,640 INFO L290 TraceCheckUtils]: 233: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,640 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-07 14:34:28,640 INFO L290 TraceCheckUtils]: 235: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,640 INFO L290 TraceCheckUtils]: 236: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,640 INFO L290 TraceCheckUtils]: 237: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,640 INFO L284 TraceCheckUtils]: 238: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:28,640 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-07 14:34:28,640 INFO L290 TraceCheckUtils]: 240: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,640 INFO L290 TraceCheckUtils]: 241: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,640 INFO L290 TraceCheckUtils]: 242: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,640 INFO L284 TraceCheckUtils]: 243: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:28,640 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-07 14:34:28,640 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-07 14:34:28,640 INFO L290 TraceCheckUtils]: 246: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,640 INFO L290 TraceCheckUtils]: 247: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,641 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-07 14:34:28,641 INFO L290 TraceCheckUtils]: 249: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,641 INFO L290 TraceCheckUtils]: 250: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,641 INFO L290 TraceCheckUtils]: 251: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,641 INFO L284 TraceCheckUtils]: 252: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:28,641 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-07 14:34:28,641 INFO L290 TraceCheckUtils]: 254: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,641 INFO L290 TraceCheckUtils]: 255: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,641 INFO L290 TraceCheckUtils]: 256: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,641 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:28,641 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-07 14:34:28,641 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-07 14:34:28,641 INFO L290 TraceCheckUtils]: 260: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,641 INFO L290 TraceCheckUtils]: 261: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,641 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-07 14:34:28,641 INFO L290 TraceCheckUtils]: 263: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,641 INFO L290 TraceCheckUtils]: 264: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,641 INFO L290 TraceCheckUtils]: 265: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,642 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:28,642 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-07 14:34:28,642 INFO L290 TraceCheckUtils]: 268: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,642 INFO L290 TraceCheckUtils]: 269: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,642 INFO L290 TraceCheckUtils]: 270: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,642 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:28,642 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-07 14:34:28,642 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-07 14:34:28,642 INFO L290 TraceCheckUtils]: 274: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,642 INFO L290 TraceCheckUtils]: 275: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,642 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-07 14:34:28,642 INFO L290 TraceCheckUtils]: 277: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,642 INFO L290 TraceCheckUtils]: 278: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,642 INFO L290 TraceCheckUtils]: 279: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,642 INFO L284 TraceCheckUtils]: 280: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:28,642 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-07 14:34:28,642 INFO L290 TraceCheckUtils]: 282: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,643 INFO L290 TraceCheckUtils]: 283: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,643 INFO L290 TraceCheckUtils]: 284: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,643 INFO L284 TraceCheckUtils]: 285: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:28,643 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-07 14:34:28,643 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-07 14:34:28,643 INFO L290 TraceCheckUtils]: 288: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,643 INFO L290 TraceCheckUtils]: 289: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,643 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-07 14:34:28,643 INFO L290 TraceCheckUtils]: 291: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,643 INFO L290 TraceCheckUtils]: 292: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,643 INFO L290 TraceCheckUtils]: 293: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,643 INFO L284 TraceCheckUtils]: 294: Hoare quadruple {46810#false} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:28,643 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-07 14:34:28,643 INFO L290 TraceCheckUtils]: 296: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,643 INFO L290 TraceCheckUtils]: 297: Hoare triple {46810#false} assume !(0 == ~cond); {46810#false} is VALID [2022-04-07 14:34:28,643 INFO L290 TraceCheckUtils]: 298: Hoare triple {46810#false} assume true; {46810#false} is VALID [2022-04-07 14:34:28,643 INFO L284 TraceCheckUtils]: 299: Hoare quadruple {46810#false} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:28,643 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-07 14:34:28,644 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-07 14:34:28,644 INFO L290 TraceCheckUtils]: 302: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,644 INFO L290 TraceCheckUtils]: 303: Hoare triple {46810#false} assume !(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:28,644 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-07 14:34:28,644 INFO L290 TraceCheckUtils]: 305: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:28,644 INFO L290 TraceCheckUtils]: 306: Hoare triple {46810#false} assume 0 == ~cond; {46810#false} is VALID [2022-04-07 14:34:28,644 INFO L290 TraceCheckUtils]: 307: Hoare triple {46810#false} assume !false; {46810#false} is VALID [2022-04-07 14:34:28,645 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-07 14:34:28,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:34:31,709 INFO L290 TraceCheckUtils]: 307: Hoare triple {46810#false} assume !false; {46810#false} is VALID [2022-04-07 14:34:31,709 INFO L290 TraceCheckUtils]: 306: Hoare triple {46810#false} assume 0 == ~cond; {46810#false} is VALID [2022-04-07 14:34:31,709 INFO L290 TraceCheckUtils]: 305: Hoare triple {46810#false} ~cond := #in~cond; {46810#false} is VALID [2022-04-07 14:34:31,710 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-07 14:34:31,710 INFO L290 TraceCheckUtils]: 303: Hoare triple {46810#false} assume !(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,710 INFO L290 TraceCheckUtils]: 302: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,710 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-07 14:34:31,710 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-07 14:34:31,710 INFO L284 TraceCheckUtils]: 299: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:31,710 INFO L290 TraceCheckUtils]: 298: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,710 INFO L290 TraceCheckUtils]: 297: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,710 INFO L290 TraceCheckUtils]: 296: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,710 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-07 14:34:31,710 INFO L284 TraceCheckUtils]: 294: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:31,710 INFO L290 TraceCheckUtils]: 293: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,710 INFO L290 TraceCheckUtils]: 292: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,710 INFO L290 TraceCheckUtils]: 291: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,710 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-07 14:34:31,710 INFO L290 TraceCheckUtils]: 289: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,710 INFO L290 TraceCheckUtils]: 288: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,711 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-07 14:34:31,711 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-07 14:34:31,711 INFO L284 TraceCheckUtils]: 285: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:31,711 INFO L290 TraceCheckUtils]: 284: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,711 INFO L290 TraceCheckUtils]: 283: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,711 INFO L290 TraceCheckUtils]: 282: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,711 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-07 14:34:31,711 INFO L284 TraceCheckUtils]: 280: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:31,711 INFO L290 TraceCheckUtils]: 279: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,711 INFO L290 TraceCheckUtils]: 278: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,711 INFO L290 TraceCheckUtils]: 277: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,711 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-07 14:34:31,711 INFO L290 TraceCheckUtils]: 275: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,711 INFO L290 TraceCheckUtils]: 274: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,711 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-07 14:34:31,711 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-07 14:34:31,711 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:31,711 INFO L290 TraceCheckUtils]: 270: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,712 INFO L290 TraceCheckUtils]: 269: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,712 INFO L290 TraceCheckUtils]: 268: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,712 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-07 14:34:31,712 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:31,712 INFO L290 TraceCheckUtils]: 265: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,712 INFO L290 TraceCheckUtils]: 264: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,712 INFO L290 TraceCheckUtils]: 263: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,712 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-07 14:34:31,712 INFO L290 TraceCheckUtils]: 261: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,712 INFO L290 TraceCheckUtils]: 260: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,712 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-07 14:34:31,712 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-07 14:34:31,712 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:31,712 INFO L290 TraceCheckUtils]: 256: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,712 INFO L290 TraceCheckUtils]: 255: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,712 INFO L290 TraceCheckUtils]: 254: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,712 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-07 14:34:31,713 INFO L284 TraceCheckUtils]: 252: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:31,713 INFO L290 TraceCheckUtils]: 251: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,713 INFO L290 TraceCheckUtils]: 250: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,713 INFO L290 TraceCheckUtils]: 249: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,713 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-07 14:34:31,713 INFO L290 TraceCheckUtils]: 247: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,713 INFO L290 TraceCheckUtils]: 246: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,713 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-07 14:34:31,713 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-07 14:34:31,713 INFO L284 TraceCheckUtils]: 243: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:31,713 INFO L290 TraceCheckUtils]: 242: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,713 INFO L290 TraceCheckUtils]: 241: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,713 INFO L290 TraceCheckUtils]: 240: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,713 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-07 14:34:31,713 INFO L284 TraceCheckUtils]: 238: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:31,713 INFO L290 TraceCheckUtils]: 237: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,713 INFO L290 TraceCheckUtils]: 236: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,713 INFO L290 TraceCheckUtils]: 235: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,714 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-07 14:34:31,714 INFO L290 TraceCheckUtils]: 233: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,714 INFO L290 TraceCheckUtils]: 232: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,714 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-07 14:34:31,714 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-07 14:34:31,714 INFO L284 TraceCheckUtils]: 229: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:31,714 INFO L290 TraceCheckUtils]: 228: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,714 INFO L290 TraceCheckUtils]: 227: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,714 INFO L290 TraceCheckUtils]: 226: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,714 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-07 14:34:31,714 INFO L284 TraceCheckUtils]: 224: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:31,714 INFO L290 TraceCheckUtils]: 223: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,714 INFO L290 TraceCheckUtils]: 222: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,714 INFO L290 TraceCheckUtils]: 221: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,714 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-07 14:34:31,714 INFO L290 TraceCheckUtils]: 219: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,714 INFO L290 TraceCheckUtils]: 218: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,715 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-07 14:34:31,715 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-07 14:34:31,715 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:31,715 INFO L290 TraceCheckUtils]: 214: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,715 INFO L290 TraceCheckUtils]: 213: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,715 INFO L290 TraceCheckUtils]: 212: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,715 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-07 14:34:31,715 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:31,715 INFO L290 TraceCheckUtils]: 209: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,715 INFO L290 TraceCheckUtils]: 208: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,715 INFO L290 TraceCheckUtils]: 207: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,715 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-07 14:34:31,715 INFO L290 TraceCheckUtils]: 205: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,715 INFO L290 TraceCheckUtils]: 204: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,715 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-07 14:34:31,715 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-07 14:34:31,715 INFO L284 TraceCheckUtils]: 201: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:31,715 INFO L290 TraceCheckUtils]: 200: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,716 INFO L290 TraceCheckUtils]: 199: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,716 INFO L290 TraceCheckUtils]: 198: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,716 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-07 14:34:31,716 INFO L284 TraceCheckUtils]: 196: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:31,716 INFO L290 TraceCheckUtils]: 195: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,716 INFO L290 TraceCheckUtils]: 194: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,716 INFO L290 TraceCheckUtils]: 193: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,716 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-07 14:34:31,716 INFO L290 TraceCheckUtils]: 191: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,716 INFO L290 TraceCheckUtils]: 190: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,716 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-07 14:34:31,716 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-07 14:34:31,716 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:31,716 INFO L290 TraceCheckUtils]: 186: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,716 INFO L290 TraceCheckUtils]: 185: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,716 INFO L290 TraceCheckUtils]: 184: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,716 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-07 14:34:31,717 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:31,717 INFO L290 TraceCheckUtils]: 181: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,717 INFO L290 TraceCheckUtils]: 180: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,719 INFO L290 TraceCheckUtils]: 179: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,719 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-07 14:34:31,719 INFO L290 TraceCheckUtils]: 177: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,719 INFO L290 TraceCheckUtils]: 176: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,719 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-07 14:34:31,719 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-07 14:34:31,719 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {46809#true} {46810#false} #86#return; {46810#false} is VALID [2022-04-07 14:34:31,719 INFO L290 TraceCheckUtils]: 172: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,719 INFO L290 TraceCheckUtils]: 171: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,720 INFO L290 TraceCheckUtils]: 170: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,720 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-07 14:34:31,720 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {46809#true} {46810#false} #84#return; {46810#false} is VALID [2022-04-07 14:34:31,720 INFO L290 TraceCheckUtils]: 167: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,720 INFO L290 TraceCheckUtils]: 166: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,720 INFO L290 TraceCheckUtils]: 165: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,720 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-07 14:34:31,720 INFO L290 TraceCheckUtils]: 163: Hoare triple {46810#false} assume !!(#t~post6 < 20);havoc #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,720 INFO L290 TraceCheckUtils]: 162: Hoare triple {46810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46810#false} is VALID [2022-04-07 14:34:31,720 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-07 14:34:31,720 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-07 14:34:31,721 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #86#return; {46829#(= main_~p~0 1)} is VALID [2022-04-07 14:34:31,721 INFO L290 TraceCheckUtils]: 158: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,721 INFO L290 TraceCheckUtils]: 157: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,721 INFO L290 TraceCheckUtils]: 156: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,721 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-07 14:34:31,722 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {46809#true} {46829#(= main_~p~0 1)} #84#return; {46829#(= main_~p~0 1)} is VALID [2022-04-07 14:34:31,722 INFO L290 TraceCheckUtils]: 153: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,722 INFO L290 TraceCheckUtils]: 152: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,722 INFO L290 TraceCheckUtils]: 151: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,722 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-07 14:34:31,722 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-07 14:34:31,722 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-07 14:34:31,722 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-07 14:34:31,723 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-07 14:34:31,724 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-07 14:34:31,724 INFO L290 TraceCheckUtils]: 144: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,724 INFO L290 TraceCheckUtils]: 143: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,724 INFO L290 TraceCheckUtils]: 142: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,724 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-07 14:34:31,724 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-07 14:34:31,724 INFO L290 TraceCheckUtils]: 139: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,724 INFO L290 TraceCheckUtils]: 138: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,724 INFO L290 TraceCheckUtils]: 137: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,724 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-07 14:34:31,725 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-07 14:34:31,725 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-07 14:34:31,725 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-07 14:34:31,726 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-07 14:34:31,727 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-07 14:34:31,727 INFO L290 TraceCheckUtils]: 130: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,727 INFO L290 TraceCheckUtils]: 129: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,727 INFO L290 TraceCheckUtils]: 128: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,727 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-07 14:34:31,727 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-07 14:34:31,728 INFO L290 TraceCheckUtils]: 125: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,728 INFO L290 TraceCheckUtils]: 124: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,728 INFO L290 TraceCheckUtils]: 123: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,728 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-07 14:34:31,728 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-07 14:34:31,728 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-07 14:34:31,729 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-07 14:34:31,731 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-07 14:34:31,731 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-07 14:34:31,732 INFO L290 TraceCheckUtils]: 116: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,732 INFO L290 TraceCheckUtils]: 115: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,732 INFO L290 TraceCheckUtils]: 114: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,732 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-07 14:34:31,732 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-07 14:34:31,732 INFO L290 TraceCheckUtils]: 111: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,732 INFO L290 TraceCheckUtils]: 110: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,732 INFO L290 TraceCheckUtils]: 109: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,732 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-07 14:34:31,733 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-07 14:34:31,735 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-07 14:34:31,736 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-07 14:34:31,740 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-07 14:34:31,741 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-07 14:34:31,741 INFO L290 TraceCheckUtils]: 102: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,741 INFO L290 TraceCheckUtils]: 101: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,741 INFO L290 TraceCheckUtils]: 100: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,741 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-07 14:34:31,742 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-07 14:34:31,742 INFO L290 TraceCheckUtils]: 97: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,742 INFO L290 TraceCheckUtils]: 96: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,743 INFO L290 TraceCheckUtils]: 95: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,743 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-07 14:34:31,744 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-07 14:34:31,745 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-07 14:34:31,746 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-07 14:34:31,751 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-07 14:34:31,752 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-07 14:34:31,752 INFO L290 TraceCheckUtils]: 88: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,752 INFO L290 TraceCheckUtils]: 87: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,752 INFO L290 TraceCheckUtils]: 86: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,752 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-07 14:34:31,752 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-07 14:34:31,753 INFO L290 TraceCheckUtils]: 83: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,753 INFO L290 TraceCheckUtils]: 82: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,753 INFO L290 TraceCheckUtils]: 81: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,753 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-07 14:34:31,754 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-07 14:34:31,755 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-07 14:34:31,756 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-07 14:34:31,756 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-07 14:34:31,756 INFO L290 TraceCheckUtils]: 75: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,756 INFO L290 TraceCheckUtils]: 74: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,756 INFO L290 TraceCheckUtils]: 73: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,756 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-07 14:34:31,757 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-07 14:34:31,757 INFO L290 TraceCheckUtils]: 70: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,757 INFO L290 TraceCheckUtils]: 69: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,757 INFO L290 TraceCheckUtils]: 68: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,757 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-07 14:34:31,757 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-07 14:34:31,757 INFO L290 TraceCheckUtils]: 65: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,758 INFO L290 TraceCheckUtils]: 64: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,758 INFO L290 TraceCheckUtils]: 63: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,758 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-07 14:34:31,759 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-07 14:34:31,760 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-07 14:34:31,763 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-07 14:34:31,764 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-07 14:34:31,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,764 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-07 14:34:31,765 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-07 14:34:31,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,765 INFO L290 TraceCheckUtils]: 51: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,765 INFO L290 TraceCheckUtils]: 50: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,765 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-07 14:34:31,765 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-07 14:34:31,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,765 INFO L290 TraceCheckUtils]: 45: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,765 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-07 14:34:31,766 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-07 14:34:31,767 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-07 14:34:31,770 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-07 14:34:31,771 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-07 14:34:31,771 INFO L290 TraceCheckUtils]: 39: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,771 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-07 14:34:31,771 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-07 14:34:31,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,772 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-07 14:34:31,772 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-07 14:34:31,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,772 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-07 14:34:31,773 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-07 14:34:31,774 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-07 14:34:31,775 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-07 14:34:31,776 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-07 14:34:31,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,776 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-07 14:34:31,776 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-07 14:34:31,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,777 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-07 14:34:31,777 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-07 14:34:31,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {46809#true} assume !(0 == ~cond); {46809#true} is VALID [2022-04-07 14:34:31,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {46809#true} ~cond := #in~cond; {46809#true} is VALID [2022-04-07 14:34:31,777 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-07 14:34:31,778 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-07 14:34:31,778 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-07 14:34:31,778 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-07 14:34:31,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {46809#true} call #t~ret7 := main(); {46809#true} is VALID [2022-04-07 14:34:31,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46809#true} {46809#true} #92#return; {46809#true} is VALID [2022-04-07 14:34:31,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {46809#true} assume true; {46809#true} is VALID [2022-04-07 14:34:31,779 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-07 14:34:31,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {46809#true} call ULTIMATE.init(); {46809#true} is VALID [2022-04-07 14:34:31,780 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-07 14:34:31,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:34:31,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336870273] [2022-04-07 14:34:31,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:34:31,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626081694] [2022-04-07 14:34:31,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626081694] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:34:31,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:34:31,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2022-04-07 14:34:31,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221352541] [2022-04-07 14:34:31,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:34:31,782 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