/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:22:12,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:22:12,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:22:12,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:22:12,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:22:12,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:22:12,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:22:12,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:22:12,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:22:12,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:22:12,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:22:12,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:22:12,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:22:12,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:22:12,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:22:12,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:22:12,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:22:12,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:22:12,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:22:12,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:22:12,229 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:22:12,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:22:12,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:22:12,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:22:12,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:22:12,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:22:12,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:22:12,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:22:12,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:22:12,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:22:12,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:22:12,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:22:12,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:22:12,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:22:12,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:22:12,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:22:12,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:22:12,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:22:12,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:22:12,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:22:12,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:22:12,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:22:12,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:22:12,282 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:22:12,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:22:12,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:22:12,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:22:12,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:22:12,284 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:22:12,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:22:12,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:22:12,285 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:22:12,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:22:12,285 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:22:12,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:22:12,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:22:12,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:22:12,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:22:12,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:22:12,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:22:12,287 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:22:12,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:22:12,287 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:22:12,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:22:12,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:22:12,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:22:12,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:22:12,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:22:12,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:22:12,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:22:12,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:22:12,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:22:12,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:22:12,289 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:22:12,289 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:22:12,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:22:12,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:22:12,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:22:12,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:22:12,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:22:12,542 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:22:12,542 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:22:12,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound100.c [2022-04-27 13:22:12,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d4d6480/64e7b338eae24b56af63db792b2576a6/FLAGaa79a4ce0 [2022-04-27 13:22:12,983 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:22:12,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound100.c [2022-04-27 13:22:12,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d4d6480/64e7b338eae24b56af63db792b2576a6/FLAGaa79a4ce0 [2022-04-27 13:22:13,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d4d6480/64e7b338eae24b56af63db792b2576a6 [2022-04-27 13:22:13,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:22:13,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:22:13,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:22:13,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:22:13,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:22:13,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:22:13" (1/1) ... [2022-04-27 13:22:13,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa77298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:13, skipping insertion in model container [2022-04-27 13:22:13,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:22:13" (1/1) ... [2022-04-27 13:22:13,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:22:13,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:22:13,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound100.c[538,551] [2022-04-27 13:22:13,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:22:13,582 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:22:13,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound100.c[538,551] [2022-04-27 13:22:13,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:22:13,636 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:22:13,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:13 WrapperNode [2022-04-27 13:22:13,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:22:13,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:22:13,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:22:13,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:22:13,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:13" (1/1) ... [2022-04-27 13:22:13,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:13" (1/1) ... [2022-04-27 13:22:13,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:13" (1/1) ... [2022-04-27 13:22:13,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:13" (1/1) ... [2022-04-27 13:22:13,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:13" (1/1) ... [2022-04-27 13:22:13,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:13" (1/1) ... [2022-04-27 13:22:13,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:13" (1/1) ... [2022-04-27 13:22:13,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:22:13,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:22:13,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:22:13,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:22:13,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:13" (1/1) ... [2022-04-27 13:22:13,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:22:13,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:13,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:22:13,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:22:13,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:22:13,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:22:13,754 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:22:13,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:22:13,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:22:13,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:22:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:22:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:22:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:22:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:22:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:22:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:22:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:22:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:22:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:22:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:22:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:22:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:22:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:22:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:22:13,816 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:22:13,818 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:22:14,036 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:22:14,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:22:14,042 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:22:14,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:22:14 BoogieIcfgContainer [2022-04-27 13:22:14,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:22:14,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:22:14,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:22:14,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:22:14,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:22:13" (1/3) ... [2022-04-27 13:22:14,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381b5e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:22:14, skipping insertion in model container [2022-04-27 13:22:14,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:13" (2/3) ... [2022-04-27 13:22:14,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381b5e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:22:14, skipping insertion in model container [2022-04-27 13:22:14,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:22:14" (3/3) ... [2022-04-27 13:22:14,056 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound100.c [2022-04-27 13:22:14,068 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:22:14,068 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:22:14,127 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:22:14,143 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16d1d633, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@161e71bd [2022-04-27 13:22:14,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:22:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:22:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:22:14,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:14,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:14,161 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:14,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-27 13:22:14,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:14,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414198273] [2022-04-27 13:22:14,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:14,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:14,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:22:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:14,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:22:14,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:22:14,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:22:14,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:22:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:14,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:22:14,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:22:14,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:22:14,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:22:14,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:22:14,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:22:14,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:22:14,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:22:14,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-27 13:22:14,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-27 13:22:14,359 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-27 13:22:14,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:22:14,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:22:14,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:22:14,360 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:22:14,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {41#false} is VALID [2022-04-27 13:22:14,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:22:14,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:22:14,361 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {41#false} is VALID [2022-04-27 13:22:14,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:22:14,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:22:14,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:22:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:22:14,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:14,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414198273] [2022-04-27 13:22:14,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414198273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:14,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:14,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:22:14,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203993231] [2022-04-27 13:22:14,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:14,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:22:14,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:14,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:22:14,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:14,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:22:14,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:14,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:22:14,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:22:14,418 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:22:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:14,590 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-27 13:22:14,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:22:14,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:22:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:22:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:22:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:22:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:22:14,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-27 13:22:14,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:14,738 INFO L225 Difference]: With dead ends: 66 [2022-04-27 13:22:14,738 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 13:22:14,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:22:14,744 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:14,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:22:14,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 13:22:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-27 13:22:14,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:14,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:14,773 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:14,774 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:14,779 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:22:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:22:14,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:14,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:14,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-27 13:22:14,780 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-27 13:22:14,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:14,784 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:22:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:22:14,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:14,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:14,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:14,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 13:22:14,790 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-27 13:22:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:14,790 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 13:22:14,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:22:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 13:22:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:22:14,791 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:14,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:14,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:22:14,792 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:14,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:14,793 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-27 13:22:14,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:14,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553768715] [2022-04-27 13:22:14,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:14,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:14,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:22:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:14,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {256#true} is VALID [2022-04-27 13:22:14,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:22:14,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:22:14,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:22:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:14,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:22:14,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:22:14,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:22:14,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:22:14,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:22:14,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {256#true} is VALID [2022-04-27 13:22:14,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:22:14,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:22:14,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret8 := main(); {256#true} is VALID [2022-04-27 13:22:14,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {256#true} is VALID [2022-04-27 13:22:14,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {256#true} is VALID [2022-04-27 13:22:14,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:22:14,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:22:14,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:22:14,906 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:22:14,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:22:14,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:22:14,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(= main_~q~0 0)} assume !!(#t~post6 < 100);havoc #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:22:14,908 INFO L272 TraceCheckUtils]: 14: Hoare triple {265#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:22:14,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:22:14,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-27 13:22:14,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 13:22:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:22:14,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:14,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553768715] [2022-04-27 13:22:14,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553768715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:14,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:14,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:22:14,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903445583] [2022-04-27 13:22:14,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:14,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:22:14,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:14,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:22:14,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:14,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:22:14,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:14,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:22:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:22:14,935 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:22:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:15,339 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:22:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:22:15,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:22:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:22:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:22:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:22:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:22:15,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:22:15,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:15,435 INFO L225 Difference]: With dead ends: 47 [2022-04-27 13:22:15,435 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 13:22:15,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:22:15,441 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:15,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:22:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 13:22:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-27 13:22:15,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:15,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:15,453 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:15,454 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:15,457 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:22:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:22:15,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:15,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:15,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 13:22:15,459 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 13:22:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:15,462 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:22:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:22:15,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:15,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:15,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:15,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-27 13:22:15,466 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-27 13:22:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:15,466 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-27 13:22:15,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:22:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-27 13:22:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 13:22:15,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:15,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:15,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:22:15,468 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:15,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:15,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-27 13:22:15,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:15,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279665618] [2022-04-27 13:22:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:15,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:15,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:15,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [745654040] [2022-04-27 13:22:15,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:15,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:15,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:15,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:22:15,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:22:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:15,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:22:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:15,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:15,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2022-04-27 13:22:15,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:15,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:15,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#(<= ~counter~0 0)} {489#true} #96#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:15,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#(<= ~counter~0 0)} call #t~ret8 := main(); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:15,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:15,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {497#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:15,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#(<= ~counter~0 0)} ~cond := #in~cond; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:15,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#(<= ~counter~0 0)} assume !(0 == ~cond); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:15,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:15,737 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {497#(<= ~counter~0 0)} {497#(<= ~counter~0 0)} #80#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:15,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:15,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {497#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {531#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:22:15,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {490#false} is VALID [2022-04-27 13:22:15,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {490#false} is VALID [2022-04-27 13:22:15,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !(#t~post7 < 100);havoc #t~post7; {490#false} is VALID [2022-04-27 13:22:15,739 INFO L272 TraceCheckUtils]: 16: Hoare triple {490#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {490#false} is VALID [2022-04-27 13:22:15,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-27 13:22:15,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-27 13:22:15,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-27 13:22:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:22:15,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:22:15,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:15,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279665618] [2022-04-27 13:22:15,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:15,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745654040] [2022-04-27 13:22:15,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745654040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:15,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:15,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:22:15,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28633113] [2022-04-27 13:22:15,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:15,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 13:22:15,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:15,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:22:15,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:15,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:22:15,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:15,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:22:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:22:15,759 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:22:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:15,839 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-27 13:22:15,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:22:15,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 13:22:15,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:22:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:22:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:22:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:22:15,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-27 13:22:15,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:15,910 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:22:15,910 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 13:22:15,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:22:15,911 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:15,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:22:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 13:22:15,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 13:22:15,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:15,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:15,920 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:15,920 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:15,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:15,922 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:22:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:22:15,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:15,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:15,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-27 13:22:15,924 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-27 13:22:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:15,927 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:22:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:22:15,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:15,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:15,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:15,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-27 13:22:15,935 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-27 13:22:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:15,935 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-27 13:22:15,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:22:15,935 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:22:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:22:15,936 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:15,936 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:15,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:22:16,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:16,152 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:16,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-27 13:22:16,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:16,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818671958] [2022-04-27 13:22:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:16,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:22:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:16,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {757#true} is VALID [2022-04-27 13:22:16,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:16,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:22:16,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:22:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:16,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:22:16,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:22:16,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:16,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:22:16,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 13:22:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:16,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:22:16,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:22:16,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:16,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #82#return; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:16,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {757#true} call ULTIMATE.init(); {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:22:16,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {757#true} is VALID [2022-04-27 13:22:16,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:16,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:22:16,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} call #t~ret8 := main(); {757#true} is VALID [2022-04-27 13:22:16,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {757#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {757#true} is VALID [2022-04-27 13:22:16,295 INFO L272 TraceCheckUtils]: 6: Hoare triple {757#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {757#true} is VALID [2022-04-27 13:22:16,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:22:16,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:22:16,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:16,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:22:16,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {757#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:16,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:16,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} assume !!(#t~post6 < 100);havoc #t~post6; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:16,298 INFO L272 TraceCheckUtils]: 14: Hoare triple {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {757#true} is VALID [2022-04-27 13:22:16,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:22:16,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:22:16,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:16,299 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {757#true} {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #82#return; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:16,302 INFO L272 TraceCheckUtils]: 19: Hoare triple {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:22:16,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {771#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {772#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:22:16,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {772#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {758#false} is VALID [2022-04-27 13:22:16,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} assume !false; {758#false} is VALID [2022-04-27 13:22:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:22:16,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:16,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818671958] [2022-04-27 13:22:16,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818671958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:16,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:16,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:22:16,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435301360] [2022-04-27 13:22:16,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:16,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:22:16,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:16,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:22:16,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:16,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:22:16,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:16,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:22:16,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:22:16,332 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:22:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:16,703 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:22:16,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:22:16,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:22:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:22:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:22:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:22:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:22:16,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:22:16,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:16,769 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:22:16,769 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:22:16,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:22:16,770 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:16,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:22:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:22:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-27 13:22:16,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:16,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:16,779 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:16,780 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:16,782 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:22:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:22:16,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:16,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:16,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-27 13:22:16,784 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-27 13:22:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:16,786 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:22:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:22:16,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:16,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:16,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:16,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:22:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-27 13:22:16,788 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-27 13:22:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:16,789 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-27 13:22:16,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:22:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-27 13:22:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:22:16,790 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:16,790 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:16,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 13:22:16,790 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:16,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:16,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-27 13:22:16,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:16,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354463679] [2022-04-27 13:22:16,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:16,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:16,803 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:16,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444745485] [2022-04-27 13:22:16,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:16,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:16,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:16,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:22:16,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 13:22:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:16,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:22:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:16,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:17,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {1018#true} call ULTIMATE.init(); {1018#true} is VALID [2022-04-27 13:22:17,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {1018#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1018#true} is VALID [2022-04-27 13:22:17,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:22:17,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1018#true} {1018#true} #96#return; {1018#true} is VALID [2022-04-27 13:22:17,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {1018#true} call #t~ret8 := main(); {1018#true} is VALID [2022-04-27 13:22:17,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {1018#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1018#true} is VALID [2022-04-27 13:22:17,033 INFO L272 TraceCheckUtils]: 6: Hoare triple {1018#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:22:17,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:22:17,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:22:17,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:22:17,033 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1018#true} {1018#true} #80#return; {1018#true} is VALID [2022-04-27 13:22:17,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:17,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:17,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:17,037 INFO L272 TraceCheckUtils]: 14: Hoare triple {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:22:17,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:22:17,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:22:17,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:22:17,049 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1018#true} {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:17,050 INFO L272 TraceCheckUtils]: 19: Hoare triple {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:22:17,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:22:17,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:22:17,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:22:17,051 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1018#true} {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:17,052 INFO L272 TraceCheckUtils]: 24: Hoare triple {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:17,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:17,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {1100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1019#false} is VALID [2022-04-27 13:22:17,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#false} assume !false; {1019#false} is VALID [2022-04-27 13:22:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:22:17,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:22:17,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:17,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354463679] [2022-04-27 13:22:17,056 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:17,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444745485] [2022-04-27 13:22:17,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444745485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:17,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:17,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:22:17,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727253819] [2022-04-27 13:22:17,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:17,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 13:22:17,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:17,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:22:17,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:17,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:22:17,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:17,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:22:17,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:22:17,084 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:22:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:17,332 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-27 13:22:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:22:17,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 13:22:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:22:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-04-27 13:22:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:22:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-04-27 13:22:17,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 87 transitions. [2022-04-27 13:22:17,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:17,420 INFO L225 Difference]: With dead ends: 71 [2022-04-27 13:22:17,421 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 13:22:17,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:22:17,422 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:17,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 143 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:22:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 13:22:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 13:22:17,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:17,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:22:17,433 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:22:17,433 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:22:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:17,436 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-27 13:22:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-27 13:22:17,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:17,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:17,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-27 13:22:17,437 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-27 13:22:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:17,439 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-27 13:22:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-27 13:22:17,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:17,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:17,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:17,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:22:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-27 13:22:17,442 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 28 [2022-04-27 13:22:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:17,443 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-27 13:22:17,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:22:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-27 13:22:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:22:17,444 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:17,444 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:17,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:22:17,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:17,664 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:17,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:17,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-27 13:22:17,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:17,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401239054] [2022-04-27 13:22:17,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:17,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:17,679 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:17,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [10130484] [2022-04-27 13:22:17,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:17,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:17,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:17,682 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:22:17,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 13:22:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:17,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:22:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:17,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:17,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {1403#true} call ULTIMATE.init(); {1403#true} is VALID [2022-04-27 13:22:17,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {1403#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:17,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {1411#(<= ~counter~0 0)} assume true; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:17,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1411#(<= ~counter~0 0)} {1403#true} #96#return; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:17,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {1411#(<= ~counter~0 0)} call #t~ret8 := main(); {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:17,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {1411#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:17,900 INFO L272 TraceCheckUtils]: 6: Hoare triple {1411#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:17,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {1411#(<= ~counter~0 0)} ~cond := #in~cond; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:17,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {1411#(<= ~counter~0 0)} assume !(0 == ~cond); {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:17,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {1411#(<= ~counter~0 0)} assume true; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:17,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1411#(<= ~counter~0 0)} {1411#(<= ~counter~0 0)} #80#return; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:17,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {1411#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:17,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {1411#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {1445#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,904 INFO L272 TraceCheckUtils]: 14: Hoare triple {1445#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {1445#(<= ~counter~0 1)} ~cond := #in~cond; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {1445#(<= ~counter~0 1)} assume !(0 == ~cond); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {1445#(<= ~counter~0 1)} assume true; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,905 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1445#(<= ~counter~0 1)} {1445#(<= ~counter~0 1)} #82#return; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,906 INFO L272 TraceCheckUtils]: 19: Hoare triple {1445#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {1445#(<= ~counter~0 1)} ~cond := #in~cond; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {1445#(<= ~counter~0 1)} assume !(0 == ~cond); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {1445#(<= ~counter~0 1)} assume true; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,907 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1445#(<= ~counter~0 1)} {1445#(<= ~counter~0 1)} #84#return; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,908 INFO L272 TraceCheckUtils]: 24: Hoare triple {1445#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {1445#(<= ~counter~0 1)} ~cond := #in~cond; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {1445#(<= ~counter~0 1)} assume !(0 == ~cond); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {1445#(<= ~counter~0 1)} assume true; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,910 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1445#(<= ~counter~0 1)} {1445#(<= ~counter~0 1)} #86#return; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {1445#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:17,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {1445#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1500#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:22:17,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {1500#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {1404#false} is VALID [2022-04-27 13:22:17,911 INFO L272 TraceCheckUtils]: 32: Hoare triple {1404#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1404#false} is VALID [2022-04-27 13:22:17,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {1404#false} ~cond := #in~cond; {1404#false} is VALID [2022-04-27 13:22:17,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {1404#false} assume 0 == ~cond; {1404#false} is VALID [2022-04-27 13:22:17,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {1404#false} assume !false; {1404#false} is VALID [2022-04-27 13:22:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:22:17,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:22:17,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:17,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401239054] [2022-04-27 13:22:17,912 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:17,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10130484] [2022-04-27 13:22:17,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10130484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:17,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:17,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:22:17,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600233874] [2022-04-27 13:22:17,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:17,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 13:22:17,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:17,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:22:17,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:17,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:22:17,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:17,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:22:17,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:22:17,946 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:22:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:18,102 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-04-27 13:22:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:22:18,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 13:22:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:22:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:22:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:22:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:22:18,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:22:18,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:18,158 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:22:18,158 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 13:22:18,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:22:18,159 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:18,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:22:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 13:22:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-27 13:22:18,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:18,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:22:18,173 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:22:18,174 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:22:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:18,176 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-27 13:22:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-27 13:22:18,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:18,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:18,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-27 13:22:18,177 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-27 13:22:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:18,179 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-27 13:22:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-27 13:22:18,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:18,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:18,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:18,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:22:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-04-27 13:22:18,183 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 36 [2022-04-27 13:22:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:18,183 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-04-27 13:22:18,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:22:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-04-27 13:22:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:22:18,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:18,184 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:18,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:22:18,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:18,404 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:18,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-27 13:22:18,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:18,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305944993] [2022-04-27 13:22:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:18,419 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:18,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1842303993] [2022-04-27 13:22:18,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:18,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:18,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:18,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:22:18,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 13:22:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:18,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:22:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:18,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:19,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {1856#true} call ULTIMATE.init(); {1856#true} is VALID [2022-04-27 13:22:19,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1856#true} is VALID [2022-04-27 13:22:19,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:19,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} #96#return; {1856#true} is VALID [2022-04-27 13:22:19,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {1856#true} call #t~ret8 := main(); {1856#true} is VALID [2022-04-27 13:22:19,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {1856#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1856#true} is VALID [2022-04-27 13:22:19,100 INFO L272 TraceCheckUtils]: 6: Hoare triple {1856#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1856#true} is VALID [2022-04-27 13:22:19,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 13:22:19,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 13:22:19,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:19,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1856#true} {1856#true} #80#return; {1856#true} is VALID [2022-04-27 13:22:19,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {1856#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:19,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:19,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:19,102 INFO L272 TraceCheckUtils]: 14: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1856#true} is VALID [2022-04-27 13:22:19,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 13:22:19,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 13:22:19,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:19,103 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1856#true} {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #82#return; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:19,103 INFO L272 TraceCheckUtils]: 19: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1856#true} is VALID [2022-04-27 13:22:19,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 13:22:19,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 13:22:19,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:19,107 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1856#true} {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #84#return; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:19,108 INFO L272 TraceCheckUtils]: 24: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1856#true} is VALID [2022-04-27 13:22:19,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 13:22:19,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 13:22:19,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:19,109 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1856#true} {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #86#return; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:19,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:19,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:19,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:19,115 INFO L272 TraceCheckUtils]: 32: Hoare triple {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {1959#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:19,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {1959#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1963#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:19,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {1963#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1857#false} is VALID [2022-04-27 13:22:19,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {1857#false} assume !false; {1857#false} is VALID [2022-04-27 13:22:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:22:19,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:22:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:19,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305944993] [2022-04-27 13:22:19,117 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:19,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842303993] [2022-04-27 13:22:19,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842303993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:19,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:19,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:22:19,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812641318] [2022-04-27 13:22:19,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:19,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 13:22:19,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:19,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:19,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:19,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:22:19,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:19,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:22:19,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:22:19,144 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:19,475 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-04-27 13:22:19,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:22:19,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 13:22:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-27 13:22:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-27 13:22:19,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-27 13:22:19,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:19,545 INFO L225 Difference]: With dead ends: 74 [2022-04-27 13:22:19,545 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 13:22:19,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:22:19,546 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:19,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 160 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:22:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 13:22:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 13:22:19,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:19,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:19,566 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:19,566 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:19,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:19,568 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-27 13:22:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 13:22:19,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:19,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:19,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 58 states. [2022-04-27 13:22:19,569 INFO L87 Difference]: Start difference. First operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 58 states. [2022-04-27 13:22:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:19,571 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-27 13:22:19,571 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 13:22:19,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:19,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:19,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:19,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-27 13:22:19,574 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 36 [2022-04-27 13:22:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:19,574 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-27 13:22:19,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 13:22:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 13:22:19,575 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:19,575 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:19,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:22:19,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:19,791 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:19,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:19,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times [2022-04-27 13:22:19,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:19,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068705658] [2022-04-27 13:22:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:19,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:19,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:19,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178218502] [2022-04-27 13:22:19,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:19,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:19,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:19,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:22:19,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 13:22:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:19,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:22:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:19,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:20,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {2274#true} call ULTIMATE.init(); {2274#true} is VALID [2022-04-27 13:22:20,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {2274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {2282#(<= ~counter~0 0)} assume true; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2282#(<= ~counter~0 0)} {2274#true} #96#return; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {2282#(<= ~counter~0 0)} call #t~ret8 := main(); {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {2282#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {2282#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {2282#(<= ~counter~0 0)} ~cond := #in~cond; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {2282#(<= ~counter~0 0)} assume !(0 == ~cond); {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {2282#(<= ~counter~0 0)} assume true; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,071 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2282#(<= ~counter~0 0)} {2282#(<= ~counter~0 0)} #80#return; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {2282#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {2282#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {2316#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,073 INFO L272 TraceCheckUtils]: 14: Hoare triple {2316#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {2316#(<= ~counter~0 1)} ~cond := #in~cond; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {2316#(<= ~counter~0 1)} assume !(0 == ~cond); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {2316#(<= ~counter~0 1)} assume true; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,075 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2316#(<= ~counter~0 1)} {2316#(<= ~counter~0 1)} #82#return; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,076 INFO L272 TraceCheckUtils]: 19: Hoare triple {2316#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {2316#(<= ~counter~0 1)} ~cond := #in~cond; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {2316#(<= ~counter~0 1)} assume !(0 == ~cond); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {2316#(<= ~counter~0 1)} assume true; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,077 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2316#(<= ~counter~0 1)} {2316#(<= ~counter~0 1)} #84#return; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,078 INFO L272 TraceCheckUtils]: 24: Hoare triple {2316#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {2316#(<= ~counter~0 1)} ~cond := #in~cond; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {2316#(<= ~counter~0 1)} assume !(0 == ~cond); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {2316#(<= ~counter~0 1)} assume true; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,080 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2316#(<= ~counter~0 1)} {2316#(<= ~counter~0 1)} #86#return; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {2316#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {2316#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2371#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:22:20,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {2371#(<= |main_#t~post6| 1)} assume !(#t~post6 < 100);havoc #t~post6; {2275#false} is VALID [2022-04-27 13:22:20,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {2275#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2275#false} is VALID [2022-04-27 13:22:20,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {2275#false} assume !(#t~post7 < 100);havoc #t~post7; {2275#false} is VALID [2022-04-27 13:22:20,082 INFO L272 TraceCheckUtils]: 34: Hoare triple {2275#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2275#false} is VALID [2022-04-27 13:22:20,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {2275#false} ~cond := #in~cond; {2275#false} is VALID [2022-04-27 13:22:20,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {2275#false} assume 0 == ~cond; {2275#false} is VALID [2022-04-27 13:22:20,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {2275#false} assume !false; {2275#false} is VALID [2022-04-27 13:22:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:22:20,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:22:20,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {2275#false} assume !false; {2275#false} is VALID [2022-04-27 13:22:20,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {2275#false} assume 0 == ~cond; {2275#false} is VALID [2022-04-27 13:22:20,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {2275#false} ~cond := #in~cond; {2275#false} is VALID [2022-04-27 13:22:20,288 INFO L272 TraceCheckUtils]: 34: Hoare triple {2275#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2275#false} is VALID [2022-04-27 13:22:20,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {2275#false} assume !(#t~post7 < 100);havoc #t~post7; {2275#false} is VALID [2022-04-27 13:22:20,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {2275#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2275#false} is VALID [2022-04-27 13:22:20,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {2411#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {2275#false} is VALID [2022-04-27 13:22:20,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {2415#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2411#(< |main_#t~post6| 100)} is VALID [2022-04-27 13:22:20,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {2415#(< ~counter~0 100)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2415#(< ~counter~0 100)} is VALID [2022-04-27 13:22:20,291 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2274#true} {2415#(< ~counter~0 100)} #86#return; {2415#(< ~counter~0 100)} is VALID [2022-04-27 13:22:20,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 13:22:20,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {2274#true} assume !(0 == ~cond); {2274#true} is VALID [2022-04-27 13:22:20,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {2274#true} ~cond := #in~cond; {2274#true} is VALID [2022-04-27 13:22:20,291 INFO L272 TraceCheckUtils]: 24: Hoare triple {2415#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2274#true} is VALID [2022-04-27 13:22:20,292 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2274#true} {2415#(< ~counter~0 100)} #84#return; {2415#(< ~counter~0 100)} is VALID [2022-04-27 13:22:20,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 13:22:20,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {2274#true} assume !(0 == ~cond); {2274#true} is VALID [2022-04-27 13:22:20,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {2274#true} ~cond := #in~cond; {2274#true} is VALID [2022-04-27 13:22:20,292 INFO L272 TraceCheckUtils]: 19: Hoare triple {2415#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2274#true} is VALID [2022-04-27 13:22:20,293 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2274#true} {2415#(< ~counter~0 100)} #82#return; {2415#(< ~counter~0 100)} is VALID [2022-04-27 13:22:20,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 13:22:20,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {2274#true} assume !(0 == ~cond); {2274#true} is VALID [2022-04-27 13:22:20,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {2274#true} ~cond := #in~cond; {2274#true} is VALID [2022-04-27 13:22:20,294 INFO L272 TraceCheckUtils]: 14: Hoare triple {2415#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2274#true} is VALID [2022-04-27 13:22:20,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {2415#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {2415#(< ~counter~0 100)} is VALID [2022-04-27 13:22:20,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {2470#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2415#(< ~counter~0 100)} is VALID [2022-04-27 13:22:20,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {2470#(< ~counter~0 99)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2470#(< ~counter~0 99)} is VALID [2022-04-27 13:22:20,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2274#true} {2470#(< ~counter~0 99)} #80#return; {2470#(< ~counter~0 99)} is VALID [2022-04-27 13:22:20,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 13:22:20,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {2274#true} assume !(0 == ~cond); {2274#true} is VALID [2022-04-27 13:22:20,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {2274#true} ~cond := #in~cond; {2274#true} is VALID [2022-04-27 13:22:20,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {2470#(< ~counter~0 99)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2274#true} is VALID [2022-04-27 13:22:20,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {2470#(< ~counter~0 99)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2470#(< ~counter~0 99)} is VALID [2022-04-27 13:22:20,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {2470#(< ~counter~0 99)} call #t~ret8 := main(); {2470#(< ~counter~0 99)} is VALID [2022-04-27 13:22:20,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2470#(< ~counter~0 99)} {2274#true} #96#return; {2470#(< ~counter~0 99)} is VALID [2022-04-27 13:22:20,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {2470#(< ~counter~0 99)} assume true; {2470#(< ~counter~0 99)} is VALID [2022-04-27 13:22:20,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {2274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2470#(< ~counter~0 99)} is VALID [2022-04-27 13:22:20,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {2274#true} call ULTIMATE.init(); {2274#true} is VALID [2022-04-27 13:22:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:22:20,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:20,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068705658] [2022-04-27 13:22:20,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:20,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178218502] [2022-04-27 13:22:20,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178218502] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:22:20,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:22:20,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:22:20,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436700261] [2022-04-27 13:22:20,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:22:20,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-27 13:22:20,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:20,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:22:20,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:20,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:22:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:20,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:22:20,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:22:20,344 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:22:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:20,664 INFO L93 Difference]: Finished difference Result 123 states and 147 transitions. [2022-04-27 13:22:20,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:22:20,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-27 13:22:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:22:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2022-04-27 13:22:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:22:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2022-04-27 13:22:20,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 123 transitions. [2022-04-27 13:22:20,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:20,784 INFO L225 Difference]: With dead ends: 123 [2022-04-27 13:22:20,784 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 13:22:20,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:22:20,786 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 48 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:20,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 178 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:22:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 13:22:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-04-27 13:22:20,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:20,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 103 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 13:22:20,838 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 103 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 13:22:20,838 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 103 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 13:22:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:20,841 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2022-04-27 13:22:20,841 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2022-04-27 13:22:20,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:20,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:20,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 109 states. [2022-04-27 13:22:20,842 INFO L87 Difference]: Start difference. First operand has 103 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 109 states. [2022-04-27 13:22:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:20,846 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2022-04-27 13:22:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2022-04-27 13:22:20,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:20,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:20,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:20,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 13:22:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2022-04-27 13:22:20,850 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 38 [2022-04-27 13:22:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:20,850 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2022-04-27 13:22:20,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:22:20,851 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2022-04-27 13:22:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 13:22:20,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:20,852 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:20,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 13:22:21,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:21,071 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:21,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-27 13:22:21,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:21,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415762397] [2022-04-27 13:22:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:21,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:21,082 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:21,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621206633] [2022-04-27 13:22:21,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:21,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:21,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:21,083 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:22:21,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 13:22:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:21,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 13:22:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:21,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:21,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2022-04-27 13:22:21,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {3050#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3050#true} is VALID [2022-04-27 13:22:21,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:21,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #96#return; {3050#true} is VALID [2022-04-27 13:22:21,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret8 := main(); {3050#true} is VALID [2022-04-27 13:22:21,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {3050#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3050#true} is VALID [2022-04-27 13:22:21,929 INFO L272 TraceCheckUtils]: 6: Hoare triple {3050#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:21,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {3050#true} ~cond := #in~cond; {3076#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:22:21,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {3076#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3080#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:22:21,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {3080#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3080#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:22:21,932 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3080#(not (= |assume_abort_if_not_#in~cond| 0))} {3050#true} #80#return; {3087#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:22:21,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {3087#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:21,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:21,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:21,934 INFO L272 TraceCheckUtils]: 14: Hoare triple {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:21,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:21,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:21,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:21,935 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3050#true} {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:21,935 INFO L272 TraceCheckUtils]: 19: Hoare triple {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:21,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:21,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:21,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:21,936 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3050#true} {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:21,936 INFO L272 TraceCheckUtils]: 24: Hoare triple {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:21,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:21,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:21,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:21,938 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3050#true} {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #86#return; {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:21,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {3091#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:21,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:21,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 100);havoc #t~post6; {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:21,940 INFO L272 TraceCheckUtils]: 32: Hoare triple {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:21,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:21,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:21,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:21,941 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3050#true} {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:21,941 INFO L272 TraceCheckUtils]: 37: Hoare triple {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:21,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:21,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:21,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:21,942 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3050#true} {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:21,943 INFO L272 TraceCheckUtils]: 42: Hoare triple {3146#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:21,943 INFO L290 TraceCheckUtils]: 43: Hoare triple {3186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:21,944 INFO L290 TraceCheckUtils]: 44: Hoare triple {3190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3051#false} is VALID [2022-04-27 13:22:21,944 INFO L290 TraceCheckUtils]: 45: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2022-04-27 13:22:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:22:21,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:22:22,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2022-04-27 13:22:22,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {3190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3051#false} is VALID [2022-04-27 13:22:22,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {3186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:22,318 INFO L272 TraceCheckUtils]: 42: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:22,319 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3050#true} {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #84#return; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:22,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:22,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:22,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:22,319 INFO L272 TraceCheckUtils]: 37: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:22,320 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3050#true} {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:22,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:22,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:22,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:22,320 INFO L272 TraceCheckUtils]: 32: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:22,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 100);havoc #t~post6; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:22,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:22,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:22,323 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3050#true} {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #86#return; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:22,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:22,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:22,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:22,323 INFO L272 TraceCheckUtils]: 24: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:22,324 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3050#true} {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #84#return; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:22,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:22,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:22,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:22,325 INFO L272 TraceCheckUtils]: 19: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:22,325 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3050#true} {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:22,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:22,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:22,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:22,326 INFO L272 TraceCheckUtils]: 14: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:22,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 100);havoc #t~post6; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:22,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:22,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {3050#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3206#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:22,327 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3050#true} {3050#true} #80#return; {3050#true} is VALID [2022-04-27 13:22:22,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:22,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2022-04-27 13:22:22,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2022-04-27 13:22:22,327 INFO L272 TraceCheckUtils]: 6: Hoare triple {3050#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3050#true} is VALID [2022-04-27 13:22:22,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {3050#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3050#true} is VALID [2022-04-27 13:22:22,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret8 := main(); {3050#true} is VALID [2022-04-27 13:22:22,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #96#return; {3050#true} is VALID [2022-04-27 13:22:22,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-27 13:22:22,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {3050#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3050#true} is VALID [2022-04-27 13:22:22,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2022-04-27 13:22:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 13:22:22,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:22,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415762397] [2022-04-27 13:22:22,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:22,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621206633] [2022-04-27 13:22:22,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621206633] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:22:22,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:22:22,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 13:22:22,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557339673] [2022-04-27 13:22:22,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:22,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-27 13:22:22,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:22,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:22,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:22,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:22:22,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:22,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:22:22,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:22:22,358 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:22,569 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2022-04-27 13:22:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:22:22,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-27 13:22:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:22:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:22:22,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 13:22:22,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:22,636 INFO L225 Difference]: With dead ends: 120 [2022-04-27 13:22:22,636 INFO L226 Difference]: Without dead ends: 118 [2022-04-27 13:22:22,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:22:22,641 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:22,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:22:22,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-27 13:22:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2022-04-27 13:22:22,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:22,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 115 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:22:22,698 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 115 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:22:22,698 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 115 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:22:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:22,720 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2022-04-27 13:22:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2022-04-27 13:22:22,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:22,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:22,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 118 states. [2022-04-27 13:22:22,721 INFO L87 Difference]: Start difference. First operand has 115 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 118 states. [2022-04-27 13:22:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:22,726 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2022-04-27 13:22:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2022-04-27 13:22:22,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:22,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:22,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:22,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:22:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2022-04-27 13:22:22,731 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 46 [2022-04-27 13:22:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:22,731 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2022-04-27 13:22:22,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2022-04-27 13:22:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 13:22:22,733 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:22,733 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:22,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 13:22:22,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:22,947 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:22,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:22,948 INFO L85 PathProgramCache]: Analyzing trace with hash 243046571, now seen corresponding path program 1 times [2022-04-27 13:22:22,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:22,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417273444] [2022-04-27 13:22:22,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:22,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:22,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:22,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749819444] [2022-04-27 13:22:22,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:22,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:22,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:22,962 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:22:22,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 13:22:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:23,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:22:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:23,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:23,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {3904#true} call ULTIMATE.init(); {3904#true} is VALID [2022-04-27 13:22:23,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {3904#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:23,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {3912#(<= ~counter~0 0)} assume true; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:23,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3912#(<= ~counter~0 0)} {3904#true} #96#return; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:23,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {3912#(<= ~counter~0 0)} call #t~ret8 := main(); {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:23,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {3912#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:23,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {3912#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:23,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {3912#(<= ~counter~0 0)} ~cond := #in~cond; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:23,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {3912#(<= ~counter~0 0)} assume !(0 == ~cond); {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:23,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {3912#(<= ~counter~0 0)} assume true; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:23,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3912#(<= ~counter~0 0)} {3912#(<= ~counter~0 0)} #80#return; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:23,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {3912#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3912#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:23,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {3912#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {3946#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,268 INFO L272 TraceCheckUtils]: 14: Hoare triple {3946#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {3946#(<= ~counter~0 1)} ~cond := #in~cond; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {3946#(<= ~counter~0 1)} assume !(0 == ~cond); {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {3946#(<= ~counter~0 1)} assume true; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,269 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3946#(<= ~counter~0 1)} {3946#(<= ~counter~0 1)} #82#return; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,270 INFO L272 TraceCheckUtils]: 19: Hoare triple {3946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {3946#(<= ~counter~0 1)} ~cond := #in~cond; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {3946#(<= ~counter~0 1)} assume !(0 == ~cond); {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {3946#(<= ~counter~0 1)} assume true; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,271 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3946#(<= ~counter~0 1)} {3946#(<= ~counter~0 1)} #84#return; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,272 INFO L272 TraceCheckUtils]: 24: Hoare triple {3946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {3946#(<= ~counter~0 1)} ~cond := #in~cond; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {3946#(<= ~counter~0 1)} assume !(0 == ~cond); {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {3946#(<= ~counter~0 1)} assume true; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,274 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3946#(<= ~counter~0 1)} {3946#(<= ~counter~0 1)} #86#return; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {3946#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3946#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:23,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {3946#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {4001#(<= ~counter~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,275 INFO L272 TraceCheckUtils]: 32: Hoare triple {4001#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {4001#(<= ~counter~0 2)} ~cond := #in~cond; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {4001#(<= ~counter~0 2)} assume !(0 == ~cond); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {4001#(<= ~counter~0 2)} assume true; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,277 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4001#(<= ~counter~0 2)} {4001#(<= ~counter~0 2)} #82#return; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,277 INFO L272 TraceCheckUtils]: 37: Hoare triple {4001#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {4001#(<= ~counter~0 2)} ~cond := #in~cond; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {4001#(<= ~counter~0 2)} assume !(0 == ~cond); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {4001#(<= ~counter~0 2)} assume true; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,279 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4001#(<= ~counter~0 2)} {4001#(<= ~counter~0 2)} #84#return; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,279 INFO L272 TraceCheckUtils]: 42: Hoare triple {4001#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {4001#(<= ~counter~0 2)} ~cond := #in~cond; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {4001#(<= ~counter~0 2)} assume !(0 == ~cond); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {4001#(<= ~counter~0 2)} assume true; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,281 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4001#(<= ~counter~0 2)} {4001#(<= ~counter~0 2)} #86#return; {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {4001#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {4001#(<= ~counter~0 2)} is VALID [2022-04-27 13:22:23,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {4001#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4056#(<= |main_#t~post7| 2)} is VALID [2022-04-27 13:22:23,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {4056#(<= |main_#t~post7| 2)} assume !(#t~post7 < 100);havoc #t~post7; {3905#false} is VALID [2022-04-27 13:22:23,282 INFO L272 TraceCheckUtils]: 50: Hoare triple {3905#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3905#false} is VALID [2022-04-27 13:22:23,282 INFO L290 TraceCheckUtils]: 51: Hoare triple {3905#false} ~cond := #in~cond; {3905#false} is VALID [2022-04-27 13:22:23,282 INFO L290 TraceCheckUtils]: 52: Hoare triple {3905#false} assume 0 == ~cond; {3905#false} is VALID [2022-04-27 13:22:23,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {3905#false} assume !false; {3905#false} is VALID [2022-04-27 13:22:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:22:23,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:22:23,548 INFO L290 TraceCheckUtils]: 53: Hoare triple {3905#false} assume !false; {3905#false} is VALID [2022-04-27 13:22:23,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {3905#false} assume 0 == ~cond; {3905#false} is VALID [2022-04-27 13:22:23,548 INFO L290 TraceCheckUtils]: 51: Hoare triple {3905#false} ~cond := #in~cond; {3905#false} is VALID [2022-04-27 13:22:23,548 INFO L272 TraceCheckUtils]: 50: Hoare triple {3905#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3905#false} is VALID [2022-04-27 13:22:23,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {4084#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {3905#false} is VALID [2022-04-27 13:22:23,549 INFO L290 TraceCheckUtils]: 48: Hoare triple {4088#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4084#(< |main_#t~post7| 100)} is VALID [2022-04-27 13:22:23,550 INFO L290 TraceCheckUtils]: 47: Hoare triple {4088#(< ~counter~0 100)} assume !(~r~0 >= ~d~0); {4088#(< ~counter~0 100)} is VALID [2022-04-27 13:22:23,550 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3904#true} {4088#(< ~counter~0 100)} #86#return; {4088#(< ~counter~0 100)} is VALID [2022-04-27 13:22:23,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:23,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:23,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:23,551 INFO L272 TraceCheckUtils]: 42: Hoare triple {4088#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:23,551 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3904#true} {4088#(< ~counter~0 100)} #84#return; {4088#(< ~counter~0 100)} is VALID [2022-04-27 13:22:23,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:23,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:23,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:23,552 INFO L272 TraceCheckUtils]: 37: Hoare triple {4088#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:23,552 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3904#true} {4088#(< ~counter~0 100)} #82#return; {4088#(< ~counter~0 100)} is VALID [2022-04-27 13:22:23,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:23,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:23,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:23,553 INFO L272 TraceCheckUtils]: 32: Hoare triple {4088#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:23,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {4088#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {4088#(< ~counter~0 100)} is VALID [2022-04-27 13:22:23,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {4143#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4088#(< ~counter~0 100)} is VALID [2022-04-27 13:22:23,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {4143#(< ~counter~0 99)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4143#(< ~counter~0 99)} is VALID [2022-04-27 13:22:23,555 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3904#true} {4143#(< ~counter~0 99)} #86#return; {4143#(< ~counter~0 99)} is VALID [2022-04-27 13:22:23,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:23,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:23,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:23,555 INFO L272 TraceCheckUtils]: 24: Hoare triple {4143#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:23,556 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3904#true} {4143#(< ~counter~0 99)} #84#return; {4143#(< ~counter~0 99)} is VALID [2022-04-27 13:22:23,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:23,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:23,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:23,556 INFO L272 TraceCheckUtils]: 19: Hoare triple {4143#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:23,557 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3904#true} {4143#(< ~counter~0 99)} #82#return; {4143#(< ~counter~0 99)} is VALID [2022-04-27 13:22:23,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:23,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:23,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:23,557 INFO L272 TraceCheckUtils]: 14: Hoare triple {4143#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:23,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {4143#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {4143#(< ~counter~0 99)} is VALID [2022-04-27 13:22:23,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {4198#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4143#(< ~counter~0 99)} is VALID [2022-04-27 13:22:23,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {4198#(< ~counter~0 98)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {4198#(< ~counter~0 98)} is VALID [2022-04-27 13:22:23,559 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3904#true} {4198#(< ~counter~0 98)} #80#return; {4198#(< ~counter~0 98)} is VALID [2022-04-27 13:22:23,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {3904#true} assume true; {3904#true} is VALID [2022-04-27 13:22:23,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {3904#true} assume !(0 == ~cond); {3904#true} is VALID [2022-04-27 13:22:23,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {3904#true} ~cond := #in~cond; {3904#true} is VALID [2022-04-27 13:22:23,559 INFO L272 TraceCheckUtils]: 6: Hoare triple {4198#(< ~counter~0 98)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3904#true} is VALID [2022-04-27 13:22:23,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {4198#(< ~counter~0 98)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4198#(< ~counter~0 98)} is VALID [2022-04-27 13:22:23,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {4198#(< ~counter~0 98)} call #t~ret8 := main(); {4198#(< ~counter~0 98)} is VALID [2022-04-27 13:22:23,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4198#(< ~counter~0 98)} {3904#true} #96#return; {4198#(< ~counter~0 98)} is VALID [2022-04-27 13:22:23,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {4198#(< ~counter~0 98)} assume true; {4198#(< ~counter~0 98)} is VALID [2022-04-27 13:22:23,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {3904#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4198#(< ~counter~0 98)} is VALID [2022-04-27 13:22:23,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {3904#true} call ULTIMATE.init(); {3904#true} is VALID [2022-04-27 13:22:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 13:22:23,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:23,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417273444] [2022-04-27 13:22:23,562 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:23,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749819444] [2022-04-27 13:22:23,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749819444] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:22:23,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:22:23,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:22:23,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363058614] [2022-04-27 13:22:23,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:22:23,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) Word has length 54 [2022-04-27 13:22:23,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:23,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:22:23,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:23,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:22:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:23,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:22:23,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:22:23,633 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:22:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:24,191 INFO L93 Difference]: Finished difference Result 207 states and 246 transitions. [2022-04-27 13:22:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 13:22:24,192 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) Word has length 54 [2022-04-27 13:22:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:22:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 167 transitions. [2022-04-27 13:22:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:22:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 167 transitions. [2022-04-27 13:22:24,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 167 transitions. [2022-04-27 13:22:24,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:24,349 INFO L225 Difference]: With dead ends: 207 [2022-04-27 13:22:24,349 INFO L226 Difference]: Without dead ends: 193 [2022-04-27 13:22:24,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:22:24,350 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 91 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:24,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 291 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:22:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-27 13:22:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 186. [2022-04-27 13:22:24,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:24,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 186 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 125 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:22:24,410 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 186 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 125 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:22:24,410 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 186 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 125 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:22:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:24,415 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2022-04-27 13:22:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 224 transitions. [2022-04-27 13:22:24,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:24,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:24,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 125 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) Second operand 193 states. [2022-04-27 13:22:24,417 INFO L87 Difference]: Start difference. First operand has 186 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 125 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) Second operand 193 states. [2022-04-27 13:22:24,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:24,422 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2022-04-27 13:22:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 224 transitions. [2022-04-27 13:22:24,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:24,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:24,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:24,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 125 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:22:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2022-04-27 13:22:24,428 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 54 [2022-04-27 13:22:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:24,428 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2022-04-27 13:22:24,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 8 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:22:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2022-04-27 13:22:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 13:22:24,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:24,429 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:24,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 13:22:24,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:24,640 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:24,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash 244774449, now seen corresponding path program 1 times [2022-04-27 13:22:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:24,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010393042] [2022-04-27 13:22:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:24,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:24,651 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:24,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [761505429] [2022-04-27 13:22:24,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:24,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:24,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:24,652 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:22:24,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 13:22:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:24,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 13:22:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:24,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:28,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {5177#true} call ULTIMATE.init(); {5177#true} is VALID [2022-04-27 13:22:28,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {5177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5177#true} is VALID [2022-04-27 13:22:28,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:28,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5177#true} {5177#true} #96#return; {5177#true} is VALID [2022-04-27 13:22:28,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {5177#true} call #t~ret8 := main(); {5177#true} is VALID [2022-04-27 13:22:28,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {5177#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {5177#true} is VALID [2022-04-27 13:22:28,765 INFO L272 TraceCheckUtils]: 6: Hoare triple {5177#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:28,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:28,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:28,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:28,765 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5177#true} {5177#true} #80#return; {5177#true} is VALID [2022-04-27 13:22:28,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {5177#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:28,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:28,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:28,767 INFO L272 TraceCheckUtils]: 14: Hoare triple {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:28,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:28,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:28,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:28,768 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5177#true} {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #82#return; {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:28,768 INFO L272 TraceCheckUtils]: 19: Hoare triple {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:28,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:28,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:28,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:28,769 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5177#true} {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #84#return; {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:28,769 INFO L272 TraceCheckUtils]: 24: Hoare triple {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:28,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:28,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:28,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:28,770 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5177#true} {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #86#return; {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:28,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {5215#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:28,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:28,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:28,773 INFO L272 TraceCheckUtils]: 32: Hoare triple {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:28,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:28,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:28,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:28,773 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5177#true} {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #82#return; {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:28,774 INFO L272 TraceCheckUtils]: 37: Hoare triple {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:28,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:28,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:28,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:28,774 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5177#true} {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #84#return; {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:28,775 INFO L272 TraceCheckUtils]: 42: Hoare triple {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:28,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:28,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:28,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:28,775 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5177#true} {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #86#return; {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:28,777 INFO L290 TraceCheckUtils]: 47: Hoare triple {5270#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} assume !(~r~0 >= ~d~0); {5325#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:28,777 INFO L290 TraceCheckUtils]: 48: Hoare triple {5325#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5325#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:28,778 INFO L290 TraceCheckUtils]: 49: Hoare triple {5325#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {5325#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:28,779 INFO L272 TraceCheckUtils]: 50: Hoare triple {5325#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {5335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:28,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {5335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:28,779 INFO L290 TraceCheckUtils]: 52: Hoare triple {5339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5178#false} is VALID [2022-04-27 13:22:28,779 INFO L290 TraceCheckUtils]: 53: Hoare triple {5178#false} assume !false; {5178#false} is VALID [2022-04-27 13:22:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 13:22:28,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:22:29,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {5178#false} assume !false; {5178#false} is VALID [2022-04-27 13:22:29,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {5339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5178#false} is VALID [2022-04-27 13:22:29,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {5335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:29,178 INFO L272 TraceCheckUtils]: 50: Hoare triple {5355#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {5335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:29,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {5355#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !!(#t~post7 < 100);havoc #t~post7; {5355#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:22:29,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {5355#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5355#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:22:29,179 INFO L290 TraceCheckUtils]: 47: Hoare triple {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {5355#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:22:29,179 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5177#true} {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} #86#return; {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:22:29,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:29,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:29,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:29,180 INFO L272 TraceCheckUtils]: 42: Hoare triple {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:29,180 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5177#true} {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} #84#return; {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:22:29,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:29,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:29,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:29,181 INFO L272 TraceCheckUtils]: 37: Hoare triple {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:29,181 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5177#true} {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} #82#return; {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:22:29,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:29,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:29,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:29,182 INFO L272 TraceCheckUtils]: 32: Hoare triple {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:29,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:22:29,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:22:29,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5365#(or (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:22:29,184 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5177#true} {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} #86#return; {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 13:22:29,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:29,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:29,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:29,185 INFO L272 TraceCheckUtils]: 24: Hoare triple {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:29,185 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5177#true} {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} #84#return; {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 13:22:29,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:29,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:29,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:29,186 INFO L272 TraceCheckUtils]: 19: Hoare triple {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:29,186 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5177#true} {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} #82#return; {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 13:22:29,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:29,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:29,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:29,187 INFO L272 TraceCheckUtils]: 14: Hoare triple {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:29,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 13:22:29,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 13:22:29,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {5177#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {5420#(or (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-27 13:22:29,188 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5177#true} {5177#true} #80#return; {5177#true} is VALID [2022-04-27 13:22:29,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:29,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {5177#true} assume !(0 == ~cond); {5177#true} is VALID [2022-04-27 13:22:29,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {5177#true} ~cond := #in~cond; {5177#true} is VALID [2022-04-27 13:22:29,188 INFO L272 TraceCheckUtils]: 6: Hoare triple {5177#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5177#true} is VALID [2022-04-27 13:22:29,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {5177#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {5177#true} is VALID [2022-04-27 13:22:29,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {5177#true} call #t~ret8 := main(); {5177#true} is VALID [2022-04-27 13:22:29,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5177#true} {5177#true} #96#return; {5177#true} is VALID [2022-04-27 13:22:29,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {5177#true} assume true; {5177#true} is VALID [2022-04-27 13:22:29,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {5177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5177#true} is VALID [2022-04-27 13:22:29,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {5177#true} call ULTIMATE.init(); {5177#true} is VALID [2022-04-27 13:22:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 13:22:29,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:29,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010393042] [2022-04-27 13:22:29,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:29,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761505429] [2022-04-27 13:22:29,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761505429] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:22:29,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:22:29,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 13:22:29,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399761164] [2022-04-27 13:22:29,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:22:29,192 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 54 [2022-04-27 13:22:29,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:29,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:22:29,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:29,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:22:29,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:29,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:22:29,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:22:29,261 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:22:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:30,238 INFO L93 Difference]: Finished difference Result 268 states and 340 transitions. [2022-04-27 13:22:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:22:30,239 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 54 [2022-04-27 13:22:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:22:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-27 13:22:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:22:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-27 13:22:30,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-27 13:22:30,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:30,372 INFO L225 Difference]: With dead ends: 268 [2022-04-27 13:22:30,373 INFO L226 Difference]: Without dead ends: 264 [2022-04-27 13:22:30,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:22:30,374 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 53 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:30,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 213 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 13:22:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-27 13:22:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 239. [2022-04-27 13:22:30,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:30,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 239 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 163 states have internal predecessors, (189), 56 states have call successors, (56), 29 states have call predecessors, (56), 27 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:22:30,474 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 239 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 163 states have internal predecessors, (189), 56 states have call successors, (56), 29 states have call predecessors, (56), 27 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:22:30,474 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 239 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 163 states have internal predecessors, (189), 56 states have call successors, (56), 29 states have call predecessors, (56), 27 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:22:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:30,482 INFO L93 Difference]: Finished difference Result 264 states and 333 transitions. [2022-04-27 13:22:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 333 transitions. [2022-04-27 13:22:30,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:30,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:30,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 163 states have internal predecessors, (189), 56 states have call successors, (56), 29 states have call predecessors, (56), 27 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) Second operand 264 states. [2022-04-27 13:22:30,484 INFO L87 Difference]: Start difference. First operand has 239 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 163 states have internal predecessors, (189), 56 states have call successors, (56), 29 states have call predecessors, (56), 27 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) Second operand 264 states. [2022-04-27 13:22:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:30,492 INFO L93 Difference]: Finished difference Result 264 states and 333 transitions. [2022-04-27 13:22:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 333 transitions. [2022-04-27 13:22:30,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:30,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:30,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:30,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 163 states have internal predecessors, (189), 56 states have call successors, (56), 29 states have call predecessors, (56), 27 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:22:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 296 transitions. [2022-04-27 13:22:30,501 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 296 transitions. Word has length 54 [2022-04-27 13:22:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:30,501 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 296 transitions. [2022-04-27 13:22:30,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:22:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 296 transitions. [2022-04-27 13:22:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 13:22:30,503 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:30,503 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:30,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 13:22:30,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 13:22:30,716 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:30,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1142595933, now seen corresponding path program 1 times [2022-04-27 13:22:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:30,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147978552] [2022-04-27 13:22:30,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:30,729 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:30,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935900653] [2022-04-27 13:22:30,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:30,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:30,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:30,731 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:22:30,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 13:22:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:30,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 13:22:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:30,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:37,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {6750#true} call ULTIMATE.init(); {6750#true} is VALID [2022-04-27 13:22:37,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {6750#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6750#true} is VALID [2022-04-27 13:22:37,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:37,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6750#true} {6750#true} #96#return; {6750#true} is VALID [2022-04-27 13:22:37,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {6750#true} call #t~ret8 := main(); {6750#true} is VALID [2022-04-27 13:22:37,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {6750#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {6750#true} is VALID [2022-04-27 13:22:37,485 INFO L272 TraceCheckUtils]: 6: Hoare triple {6750#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:37,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:37,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:37,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:37,486 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6750#true} {6750#true} #80#return; {6750#true} is VALID [2022-04-27 13:22:37,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {6750#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:22:37,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:22:37,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:22:37,488 INFO L272 TraceCheckUtils]: 14: Hoare triple {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:37,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:37,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:37,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:37,489 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6750#true} {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:22:37,489 INFO L272 TraceCheckUtils]: 19: Hoare triple {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:37,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:37,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:37,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:37,490 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6750#true} {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:22:37,490 INFO L272 TraceCheckUtils]: 24: Hoare triple {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:37,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:37,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:37,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:37,491 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6750#true} {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:22:37,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {6788#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:37,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:37,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:37,494 INFO L272 TraceCheckUtils]: 32: Hoare triple {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:37,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:37,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:37,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:37,494 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6750#true} {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #82#return; {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:37,495 INFO L272 TraceCheckUtils]: 37: Hoare triple {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:37,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:37,495 INFO L290 TraceCheckUtils]: 39: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:37,495 INFO L290 TraceCheckUtils]: 40: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:37,496 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6750#true} {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #84#return; {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:37,496 INFO L272 TraceCheckUtils]: 42: Hoare triple {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:37,496 INFO L290 TraceCheckUtils]: 43: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:37,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:37,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:37,497 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6750#true} {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #86#return; {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:37,497 INFO L290 TraceCheckUtils]: 47: Hoare triple {6843#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !(~r~0 >= ~d~0); {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:37,498 INFO L290 TraceCheckUtils]: 48: Hoare triple {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:37,498 INFO L290 TraceCheckUtils]: 49: Hoare triple {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:37,499 INFO L272 TraceCheckUtils]: 50: Hoare triple {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:37,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:22:37,499 INFO L290 TraceCheckUtils]: 52: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:22:37,499 INFO L290 TraceCheckUtils]: 53: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:22:37,500 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6750#true} {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #88#return; {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:37,500 INFO L272 TraceCheckUtils]: 55: Hoare triple {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:22:37,500 INFO L290 TraceCheckUtils]: 56: Hoare triple {6750#true} ~cond := #in~cond; {6926#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:37,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {6926#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:22:37,501 INFO L290 TraceCheckUtils]: 58: Hoare triple {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:22:37,502 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} {6898#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (<= (div (* (- 1) main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (not (<= main_~d~0 main_~r~0)) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #90#return; {6937#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:22:37,503 INFO L290 TraceCheckUtils]: 60: Hoare triple {6937#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6941#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (* 2 (mod main_~B~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0) (= main_~p~0 1))} is VALID [2022-04-27 13:22:37,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {6941#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (* 2 (mod main_~B~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6945#(and (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-27 13:22:37,505 INFO L290 TraceCheckUtils]: 62: Hoare triple {6945#(and (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6945#(and (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-27 13:22:37,506 INFO L290 TraceCheckUtils]: 63: Hoare triple {6945#(and (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} assume !!(#t~post7 < 100);havoc #t~post7; {6945#(and (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-27 13:22:37,507 INFO L272 TraceCheckUtils]: 64: Hoare triple {6945#(and (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1) (< (mod main_~A~0 4294967296) (* 2 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6955#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:37,507 INFO L290 TraceCheckUtils]: 65: Hoare triple {6955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:37,507 INFO L290 TraceCheckUtils]: 66: Hoare triple {6959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6751#false} is VALID [2022-04-27 13:22:37,508 INFO L290 TraceCheckUtils]: 67: Hoare triple {6751#false} assume !false; {6751#false} is VALID [2022-04-27 13:22:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-27 13:22:37,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:23:14,776 WARN L232 SmtUtils]: Spent 17.25s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:24:50,329 WARN L232 SmtUtils]: Spent 15.72s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:26:05,198 INFO L290 TraceCheckUtils]: 67: Hoare triple {6751#false} assume !false; {6751#false} is VALID [2022-04-27 13:26:05,201 INFO L290 TraceCheckUtils]: 66: Hoare triple {6959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6751#false} is VALID [2022-04-27 13:26:05,201 INFO L290 TraceCheckUtils]: 65: Hoare triple {6955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:26:05,202 INFO L272 TraceCheckUtils]: 64: Hoare triple {6975#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6955#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:26:05,202 INFO L290 TraceCheckUtils]: 63: Hoare triple {6975#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !!(#t~post7 < 100);havoc #t~post7; {6975#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:26:05,202 INFO L290 TraceCheckUtils]: 62: Hoare triple {6975#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6975#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:26:05,204 INFO L290 TraceCheckUtils]: 61: Hoare triple {6985#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6975#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:26:05,213 INFO L290 TraceCheckUtils]: 60: Hoare triple {6989#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6985#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-27 13:26:05,215 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #90#return; {6989#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-27 13:26:05,216 INFO L290 TraceCheckUtils]: 58: Hoare triple {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:26:05,216 INFO L290 TraceCheckUtils]: 57: Hoare triple {7003#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6930#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:26:05,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {6750#true} ~cond := #in~cond; {7003#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:26:05,216 INFO L272 TraceCheckUtils]: 55: Hoare triple {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:05,224 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6750#true} {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #88#return; {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 13:26:05,224 INFO L290 TraceCheckUtils]: 53: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:05,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:05,224 INFO L290 TraceCheckUtils]: 51: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:05,224 INFO L272 TraceCheckUtils]: 50: Hoare triple {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:05,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} assume !!(#t~post7 < 100);havoc #t~post7; {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 13:26:05,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 13:26:05,228 INFO L290 TraceCheckUtils]: 47: Hoare triple {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {6993#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-27 13:26:05,229 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6750#true} {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} #86#return; {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:26:05,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:05,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:05,230 INFO L290 TraceCheckUtils]: 43: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:05,230 INFO L272 TraceCheckUtils]: 42: Hoare triple {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:05,231 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6750#true} {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} #84#return; {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:26:05,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:05,231 INFO L290 TraceCheckUtils]: 39: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:05,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:05,232 INFO L272 TraceCheckUtils]: 37: Hoare triple {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:05,232 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6750#true} {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} #82#return; {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:26:05,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:05,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:05,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:05,233 INFO L272 TraceCheckUtils]: 32: Hoare triple {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:05,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:26:05,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:26:05,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7031#(or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:26:05,242 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6750#true} {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} #86#return; {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} is VALID [2022-04-27 13:26:05,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:05,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:05,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:05,243 INFO L272 TraceCheckUtils]: 24: Hoare triple {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:05,243 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6750#true} {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} #84#return; {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} is VALID [2022-04-27 13:26:05,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:05,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:05,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:05,244 INFO L272 TraceCheckUtils]: 19: Hoare triple {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:05,244 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6750#true} {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} #82#return; {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} is VALID [2022-04-27 13:26:05,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:05,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:05,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:05,256 INFO L272 TraceCheckUtils]: 14: Hoare triple {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:05,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} is VALID [2022-04-27 13:26:05,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} is VALID [2022-04-27 13:26:05,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {6750#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {7086#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (* main_~p~0 2) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))) (<= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0))} is VALID [2022-04-27 13:26:05,276 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6750#true} {6750#true} #80#return; {6750#true} is VALID [2022-04-27 13:26:05,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:05,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {6750#true} assume !(0 == ~cond); {6750#true} is VALID [2022-04-27 13:26:05,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {6750#true} ~cond := #in~cond; {6750#true} is VALID [2022-04-27 13:26:05,277 INFO L272 TraceCheckUtils]: 6: Hoare triple {6750#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {6750#true} is VALID [2022-04-27 13:26:05,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {6750#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {6750#true} is VALID [2022-04-27 13:26:05,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {6750#true} call #t~ret8 := main(); {6750#true} is VALID [2022-04-27 13:26:05,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6750#true} {6750#true} #96#return; {6750#true} is VALID [2022-04-27 13:26:05,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {6750#true} assume true; {6750#true} is VALID [2022-04-27 13:26:05,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {6750#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6750#true} is VALID [2022-04-27 13:26:05,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {6750#true} call ULTIMATE.init(); {6750#true} is VALID [2022-04-27 13:26:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-27 13:26:05,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:26:05,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147978552] [2022-04-27 13:26:05,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:26:05,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935900653] [2022-04-27 13:26:05,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935900653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:26:05,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:26:05,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-27 13:26:05,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006937956] [2022-04-27 13:26:05,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:26:05,279 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) Word has length 68 [2022-04-27 13:26:05,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:26:05,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 13:26:05,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:26:05,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 13:26:05,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:26:05,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 13:26:05,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-04-27 13:26:05,391 INFO L87 Difference]: Start difference. First operand 239 states and 296 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 13:26:21,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:26:36,593 WARN L232 SmtUtils]: Spent 13.51s on a formula simplification. DAG size of input: 57 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:27:11,810 WARN L232 SmtUtils]: Spent 17.64s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:27:14,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:27:22,560 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:27:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:27:24,204 INFO L93 Difference]: Finished difference Result 357 states and 451 transitions. [2022-04-27 13:27:24,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 13:27:24,204 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) Word has length 68 [2022-04-27 13:27:24,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:27:24,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 13:27:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 150 transitions. [2022-04-27 13:27:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 13:27:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 150 transitions. [2022-04-27 13:27:24,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 150 transitions. [2022-04-27 13:27:25,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:27:25,174 INFO L225 Difference]: With dead ends: 357 [2022-04-27 13:27:25,174 INFO L226 Difference]: Without dead ends: 281 [2022-04-27 13:27:25,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 68.7s TimeCoverageRelationStatistics Valid=137, Invalid=564, Unknown=1, NotChecked=0, Total=702 [2022-04-27 13:27:25,175 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 101 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 147 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:27:25,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 209 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 437 Invalid, 2 Unknown, 0 Unchecked, 13.6s Time] [2022-04-27 13:27:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-27 13:27:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 252. [2022-04-27 13:27:25,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:27:25,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 252 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 176 states have internal predecessors, (200), 53 states have call successors, (53), 31 states have call predecessors, (53), 30 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 13:27:25,274 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 252 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 176 states have internal predecessors, (200), 53 states have call successors, (53), 31 states have call predecessors, (53), 30 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 13:27:25,274 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 252 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 176 states have internal predecessors, (200), 53 states have call successors, (53), 31 states have call predecessors, (53), 30 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 13:27:25,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:27:25,283 INFO L93 Difference]: Finished difference Result 281 states and 347 transitions. [2022-04-27 13:27:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 347 transitions. [2022-04-27 13:27:25,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:27:25,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:27:25,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 176 states have internal predecessors, (200), 53 states have call successors, (53), 31 states have call predecessors, (53), 30 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) Second operand 281 states. [2022-04-27 13:27:25,285 INFO L87 Difference]: Start difference. First operand has 252 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 176 states have internal predecessors, (200), 53 states have call successors, (53), 31 states have call predecessors, (53), 30 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) Second operand 281 states. [2022-04-27 13:27:25,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:27:25,293 INFO L93 Difference]: Finished difference Result 281 states and 347 transitions. [2022-04-27 13:27:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 347 transitions. [2022-04-27 13:27:25,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:27:25,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:27:25,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:27:25,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:27:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 176 states have internal predecessors, (200), 53 states have call successors, (53), 31 states have call predecessors, (53), 30 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 13:27:25,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 302 transitions. [2022-04-27 13:27:25,302 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 302 transitions. Word has length 68 [2022-04-27 13:27:25,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:27:25,302 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 302 transitions. [2022-04-27 13:27:25,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 9 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-27 13:27:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 302 transitions. [2022-04-27 13:27:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-27 13:27:25,303 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:27:25,303 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:27:25,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 13:27:25,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:27:25,504 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:27:25,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:27:25,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1792978632, now seen corresponding path program 1 times [2022-04-27 13:27:25,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:27:25,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587766706] [2022-04-27 13:27:25,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:27:25,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:27:25,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:27:25,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1721766554] [2022-04-27 13:27:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:27:25,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:27:25,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:27:25,522 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:27:25,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 13:27:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:27:25,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 13:27:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:27:25,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:27:30,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {8590#true} call ULTIMATE.init(); {8590#true} is VALID [2022-04-27 13:27:30,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {8590#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8590#true} is VALID [2022-04-27 13:27:30,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {8590#true} assume true; {8590#true} is VALID [2022-04-27 13:27:30,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8590#true} {8590#true} #96#return; {8590#true} is VALID [2022-04-27 13:27:30,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {8590#true} call #t~ret8 := main(); {8590#true} is VALID [2022-04-27 13:27:30,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {8590#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {8590#true} is VALID [2022-04-27 13:27:30,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {8590#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {8590#true} is VALID [2022-04-27 13:27:30,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {8590#true} ~cond := #in~cond; {8590#true} is VALID [2022-04-27 13:27:30,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {8590#true} assume !(0 == ~cond); {8590#true} is VALID [2022-04-27 13:27:30,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {8590#true} assume true; {8590#true} is VALID [2022-04-27 13:27:30,097 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8590#true} {8590#true} #80#return; {8590#true} is VALID [2022-04-27 13:27:30,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {8590#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {8628#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:27:30,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {8628#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8628#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:27:30,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {8628#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {8628#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:27:30,098 INFO L272 TraceCheckUtils]: 14: Hoare triple {8628#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8590#true} is VALID [2022-04-27 13:27:30,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {8590#true} ~cond := #in~cond; {8590#true} is VALID [2022-04-27 13:27:30,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {8590#true} assume !(0 == ~cond); {8590#true} is VALID [2022-04-27 13:27:30,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {8590#true} assume true; {8590#true} is VALID [2022-04-27 13:27:30,099 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8590#true} {8628#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {8628#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:27:30,099 INFO L272 TraceCheckUtils]: 19: Hoare triple {8628#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8590#true} is VALID [2022-04-27 13:27:30,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {8590#true} ~cond := #in~cond; {8590#true} is VALID [2022-04-27 13:27:30,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {8590#true} assume !(0 == ~cond); {8590#true} is VALID [2022-04-27 13:27:30,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {8590#true} assume true; {8590#true} is VALID [2022-04-27 13:27:30,100 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8590#true} {8628#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {8628#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:27:30,100 INFO L272 TraceCheckUtils]: 24: Hoare triple {8628#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8590#true} is VALID [2022-04-27 13:27:30,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {8590#true} ~cond := #in~cond; {8671#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:27:30,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {8671#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:27:30,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {8675#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:27:30,102 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8675#(not (= |__VERIFIER_assert_#in~cond| 0))} {8628#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {8682#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0))} is VALID [2022-04-27 13:27:30,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {8682#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 4294967296) (<= 0 main_~d~0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:27:30,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:27:30,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:27:30,104 INFO L272 TraceCheckUtils]: 32: Hoare triple {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8590#true} is VALID [2022-04-27 13:27:30,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {8590#true} ~cond := #in~cond; {8590#true} is VALID [2022-04-27 13:27:30,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {8590#true} assume !(0 == ~cond); {8590#true} is VALID [2022-04-27 13:27:30,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {8590#true} assume true; {8590#true} is VALID [2022-04-27 13:27:30,105 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8590#true} {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #82#return; {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:27:30,105 INFO L272 TraceCheckUtils]: 37: Hoare triple {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8590#true} is VALID [2022-04-27 13:27:30,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {8590#true} ~cond := #in~cond; {8590#true} is VALID [2022-04-27 13:27:30,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {8590#true} assume !(0 == ~cond); {8590#true} is VALID [2022-04-27 13:27:30,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {8590#true} assume true; {8590#true} is VALID [2022-04-27 13:27:30,105 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8590#true} {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #84#return; {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:27:30,105 INFO L272 TraceCheckUtils]: 42: Hoare triple {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8590#true} is VALID [2022-04-27 13:27:30,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {8590#true} ~cond := #in~cond; {8590#true} is VALID [2022-04-27 13:27:30,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {8590#true} assume !(0 == ~cond); {8590#true} is VALID [2022-04-27 13:27:30,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {8590#true} assume true; {8590#true} is VALID [2022-04-27 13:27:30,106 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8590#true} {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #86#return; {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:27:30,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {8686#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= 0 (div (* (- 1) main_~d~0) (- 2))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !(~r~0 >= ~d~0); {8741#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:27:30,107 INFO L290 TraceCheckUtils]: 48: Hoare triple {8741#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8741#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:27:30,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {8741#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {8741#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:27:30,107 INFO L272 TraceCheckUtils]: 50: Hoare triple {8741#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8590#true} is VALID [2022-04-27 13:27:30,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {8590#true} ~cond := #in~cond; {8590#true} is VALID [2022-04-27 13:27:30,108 INFO L290 TraceCheckUtils]: 52: Hoare triple {8590#true} assume !(0 == ~cond); {8590#true} is VALID [2022-04-27 13:27:30,108 INFO L290 TraceCheckUtils]: 53: Hoare triple {8590#true} assume true; {8590#true} is VALID [2022-04-27 13:27:30,108 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8590#true} {8741#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #88#return; {8741#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:27:30,108 INFO L272 TraceCheckUtils]: 55: Hoare triple {8741#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8590#true} is VALID [2022-04-27 13:27:30,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {8590#true} ~cond := #in~cond; {8590#true} is VALID [2022-04-27 13:27:30,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {8590#true} assume !(0 == ~cond); {8590#true} is VALID [2022-04-27 13:27:30,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {8590#true} assume true; {8590#true} is VALID [2022-04-27 13:27:30,109 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8590#true} {8741#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #90#return; {8741#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-27 13:27:30,110 INFO L290 TraceCheckUtils]: 60: Hoare triple {8741#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {8781#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 0) (<= main_~d~0 main_~r~0))} is VALID [2022-04-27 13:27:30,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {8781#(and (= (mod main_~A~0 4294967296) main_~r~0) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 0) (<= main_~d~0 main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {8785#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} is VALID [2022-04-27 13:27:30,111 INFO L290 TraceCheckUtils]: 62: Hoare triple {8785#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8785#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} is VALID [2022-04-27 13:27:30,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {8785#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} assume !!(#t~post7 < 100);havoc #t~post7; {8785#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} is VALID [2022-04-27 13:27:30,112 INFO L272 TraceCheckUtils]: 64: Hoare triple {8785#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8590#true} is VALID [2022-04-27 13:27:30,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {8590#true} ~cond := #in~cond; {8590#true} is VALID [2022-04-27 13:27:30,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {8590#true} assume !(0 == ~cond); {8590#true} is VALID [2022-04-27 13:27:30,112 INFO L290 TraceCheckUtils]: 67: Hoare triple {8590#true} assume true; {8590#true} is VALID [2022-04-27 13:27:30,113 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8590#true} {8785#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} #88#return; {8785#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} is VALID [2022-04-27 13:27:30,113 INFO L272 TraceCheckUtils]: 69: Hoare triple {8785#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8590#true} is VALID [2022-04-27 13:27:30,113 INFO L290 TraceCheckUtils]: 70: Hoare triple {8590#true} ~cond := #in~cond; {8590#true} is VALID [2022-04-27 13:27:30,113 INFO L290 TraceCheckUtils]: 71: Hoare triple {8590#true} assume !(0 == ~cond); {8590#true} is VALID [2022-04-27 13:27:30,113 INFO L290 TraceCheckUtils]: 72: Hoare triple {8590#true} assume true; {8590#true} is VALID [2022-04-27 13:27:30,113 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8590#true} {8785#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} #90#return; {8785#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} is VALID [2022-04-27 13:27:30,114 INFO L290 TraceCheckUtils]: 74: Hoare triple {8785#(and (= main_~q~0 main_~p~0) (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)))} assume !(1 != ~p~0); {8825#(and (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 1))} is VALID [2022-04-27 13:27:30,114 INFO L272 TraceCheckUtils]: 75: Hoare triple {8825#(and (<= 0 main_~r~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< (div (+ (- 1) (* (- 1) main_~d~0) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {8829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:27:30,115 INFO L290 TraceCheckUtils]: 76: Hoare triple {8829#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:27:30,115 INFO L290 TraceCheckUtils]: 77: Hoare triple {8833#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8591#false} is VALID [2022-04-27 13:27:30,115 INFO L290 TraceCheckUtils]: 78: Hoare triple {8591#false} assume !false; {8591#false} is VALID [2022-04-27 13:27:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 25 proven. 33 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-27 13:27:30,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:29:04,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:29:04,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587766706] [2022-04-27 13:29:04,073 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:29:04,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721766554] [2022-04-27 13:29:04,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721766554] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:29:04,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:29:04,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 13:29:04,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877188271] [2022-04-27 13:29:04,074 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:29:04,074 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 79 [2022-04-27 13:29:04,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:29:04,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 13:29:04,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:29:04,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 13:29:04,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:29:04,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 13:29:04,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-04-27 13:29:04,146 INFO L87 Difference]: Start difference. First operand 252 states and 302 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 13:29:08,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:08,552 INFO L93 Difference]: Finished difference Result 350 states and 433 transitions. [2022-04-27 13:29:08,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 13:29:08,552 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 79 [2022-04-27 13:29:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:29:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 13:29:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 137 transitions. [2022-04-27 13:29:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 13:29:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 137 transitions. [2022-04-27 13:29:08,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 137 transitions. [2022-04-27 13:29:08,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:29:08,709 INFO L225 Difference]: With dead ends: 350 [2022-04-27 13:29:08,709 INFO L226 Difference]: Without dead ends: 287 [2022-04-27 13:29:08,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-04-27 13:29:08,710 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 31 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:29:08,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 336 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 13:29:08,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-27 13:29:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 268. [2022-04-27 13:29:08,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:29:08,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 268 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 186 states have internal predecessors, (210), 57 states have call successors, (57), 34 states have call predecessors, (57), 32 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 13:29:08,869 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 268 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 186 states have internal predecessors, (210), 57 states have call successors, (57), 34 states have call predecessors, (57), 32 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 13:29:08,870 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 268 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 186 states have internal predecessors, (210), 57 states have call successors, (57), 34 states have call predecessors, (57), 32 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 13:29:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:08,878 INFO L93 Difference]: Finished difference Result 287 states and 348 transitions. [2022-04-27 13:29:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 348 transitions. [2022-04-27 13:29:08,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:08,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:08,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 186 states have internal predecessors, (210), 57 states have call successors, (57), 34 states have call predecessors, (57), 32 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) Second operand 287 states. [2022-04-27 13:29:08,880 INFO L87 Difference]: Start difference. First operand has 268 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 186 states have internal predecessors, (210), 57 states have call successors, (57), 34 states have call predecessors, (57), 32 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) Second operand 287 states. [2022-04-27 13:29:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:08,888 INFO L93 Difference]: Finished difference Result 287 states and 348 transitions. [2022-04-27 13:29:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 348 transitions. [2022-04-27 13:29:08,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:08,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:08,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:29:08,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:29:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 186 states have internal predecessors, (210), 57 states have call successors, (57), 34 states have call predecessors, (57), 32 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 13:29:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 320 transitions. [2022-04-27 13:29:08,897 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 320 transitions. Word has length 79 [2022-04-27 13:29:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:29:08,898 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 320 transitions. [2022-04-27 13:29:08,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 13:29:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 320 transitions. [2022-04-27 13:29:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 13:29:08,899 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:29:08,899 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:29:08,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 13:29:09,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 13:29:09,111 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:29:09,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:29:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash 437079945, now seen corresponding path program 2 times [2022-04-27 13:29:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:29:09,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395392813] [2022-04-27 13:29:09,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:29:09,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:29:09,123 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:29:09,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084281572] [2022-04-27 13:29:09,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:29:09,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:29:09,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:29:09,124 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:29:09,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 13:29:09,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:29:09,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:29:09,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:29:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:29:09,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:29:09,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {10434#true} call ULTIMATE.init(); {10434#true} is VALID [2022-04-27 13:29:09,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {10434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10434#true} is VALID [2022-04-27 13:29:09,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10434#true} {10434#true} #96#return; {10434#true} is VALID [2022-04-27 13:29:09,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {10434#true} call #t~ret8 := main(); {10434#true} is VALID [2022-04-27 13:29:09,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {10434#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {10434#true} is VALID [2022-04-27 13:29:09,355 INFO L272 TraceCheckUtils]: 6: Hoare triple {10434#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,356 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10434#true} {10434#true} #80#return; {10434#true} is VALID [2022-04-27 13:29:09,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {10434#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {10472#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {10472#(= main_~p~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,357 INFO L272 TraceCheckUtils]: 14: Hoare triple {10472#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,358 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10434#true} {10472#(= main_~p~0 1)} #82#return; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,358 INFO L272 TraceCheckUtils]: 19: Hoare triple {10472#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,358 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10434#true} {10472#(= main_~p~0 1)} #84#return; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,358 INFO L272 TraceCheckUtils]: 24: Hoare triple {10472#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,359 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10434#true} {10472#(= main_~p~0 1)} #86#return; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {10472#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10527#(= main_~p~0 2)} is VALID [2022-04-27 13:29:09,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {10527#(= main_~p~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10527#(= main_~p~0 2)} is VALID [2022-04-27 13:29:09,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {10527#(= main_~p~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {10527#(= main_~p~0 2)} is VALID [2022-04-27 13:29:09,361 INFO L272 TraceCheckUtils]: 32: Hoare triple {10527#(= main_~p~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,361 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10434#true} {10527#(= main_~p~0 2)} #82#return; {10527#(= main_~p~0 2)} is VALID [2022-04-27 13:29:09,361 INFO L272 TraceCheckUtils]: 37: Hoare triple {10527#(= main_~p~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,362 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10434#true} {10527#(= main_~p~0 2)} #84#return; {10527#(= main_~p~0 2)} is VALID [2022-04-27 13:29:09,362 INFO L272 TraceCheckUtils]: 42: Hoare triple {10527#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,363 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10434#true} {10527#(= main_~p~0 2)} #86#return; {10527#(= main_~p~0 2)} is VALID [2022-04-27 13:29:09,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {10527#(= main_~p~0 2)} assume !(~r~0 >= ~d~0); {10527#(= main_~p~0 2)} is VALID [2022-04-27 13:29:09,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {10527#(= main_~p~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10527#(= main_~p~0 2)} is VALID [2022-04-27 13:29:09,365 INFO L290 TraceCheckUtils]: 49: Hoare triple {10527#(= main_~p~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {10527#(= main_~p~0 2)} is VALID [2022-04-27 13:29:09,365 INFO L272 TraceCheckUtils]: 50: Hoare triple {10527#(= main_~p~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,365 INFO L290 TraceCheckUtils]: 51: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,365 INFO L290 TraceCheckUtils]: 52: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,366 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10434#true} {10527#(= main_~p~0 2)} #88#return; {10527#(= main_~p~0 2)} is VALID [2022-04-27 13:29:09,366 INFO L272 TraceCheckUtils]: 55: Hoare triple {10527#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,366 INFO L290 TraceCheckUtils]: 56: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,366 INFO L290 TraceCheckUtils]: 57: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,366 INFO L290 TraceCheckUtils]: 58: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,367 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10434#true} {10527#(= main_~p~0 2)} #90#return; {10527#(= main_~p~0 2)} is VALID [2022-04-27 13:29:09,367 INFO L290 TraceCheckUtils]: 60: Hoare triple {10527#(= 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); {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,368 INFO L290 TraceCheckUtils]: 61: Hoare triple {10472#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,368 INFO L290 TraceCheckUtils]: 62: Hoare triple {10472#(= main_~p~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,368 INFO L290 TraceCheckUtils]: 63: Hoare triple {10472#(= main_~p~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,368 INFO L272 TraceCheckUtils]: 64: Hoare triple {10472#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,369 INFO L290 TraceCheckUtils]: 65: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,369 INFO L290 TraceCheckUtils]: 66: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,369 INFO L290 TraceCheckUtils]: 67: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,369 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10434#true} {10472#(= main_~p~0 1)} #88#return; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,369 INFO L272 TraceCheckUtils]: 69: Hoare triple {10472#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,370 INFO L290 TraceCheckUtils]: 70: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,370 INFO L290 TraceCheckUtils]: 71: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,370 INFO L290 TraceCheckUtils]: 72: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,370 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10434#true} {10472#(= main_~p~0 1)} #90#return; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,371 INFO L290 TraceCheckUtils]: 74: Hoare triple {10472#(= 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); {10435#false} is VALID [2022-04-27 13:29:09,371 INFO L290 TraceCheckUtils]: 75: Hoare triple {10435#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10435#false} is VALID [2022-04-27 13:29:09,371 INFO L290 TraceCheckUtils]: 76: Hoare triple {10435#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10435#false} is VALID [2022-04-27 13:29:09,371 INFO L290 TraceCheckUtils]: 77: Hoare triple {10435#false} assume !!(#t~post7 < 100);havoc #t~post7; {10435#false} is VALID [2022-04-27 13:29:09,371 INFO L272 TraceCheckUtils]: 78: Hoare triple {10435#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10435#false} is VALID [2022-04-27 13:29:09,371 INFO L290 TraceCheckUtils]: 79: Hoare triple {10435#false} ~cond := #in~cond; {10435#false} is VALID [2022-04-27 13:29:09,371 INFO L290 TraceCheckUtils]: 80: Hoare triple {10435#false} assume 0 == ~cond; {10435#false} is VALID [2022-04-27 13:29:09,371 INFO L290 TraceCheckUtils]: 81: Hoare triple {10435#false} assume !false; {10435#false} is VALID [2022-04-27 13:29:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 13:29:09,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:29:09,647 INFO L290 TraceCheckUtils]: 81: Hoare triple {10435#false} assume !false; {10435#false} is VALID [2022-04-27 13:29:09,648 INFO L290 TraceCheckUtils]: 80: Hoare triple {10435#false} assume 0 == ~cond; {10435#false} is VALID [2022-04-27 13:29:09,648 INFO L290 TraceCheckUtils]: 79: Hoare triple {10435#false} ~cond := #in~cond; {10435#false} is VALID [2022-04-27 13:29:09,648 INFO L272 TraceCheckUtils]: 78: Hoare triple {10435#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10435#false} is VALID [2022-04-27 13:29:09,648 INFO L290 TraceCheckUtils]: 77: Hoare triple {10435#false} assume !!(#t~post7 < 100);havoc #t~post7; {10435#false} is VALID [2022-04-27 13:29:09,648 INFO L290 TraceCheckUtils]: 76: Hoare triple {10435#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10435#false} is VALID [2022-04-27 13:29:09,648 INFO L290 TraceCheckUtils]: 75: Hoare triple {10435#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10435#false} is VALID [2022-04-27 13:29:09,648 INFO L290 TraceCheckUtils]: 74: Hoare triple {10472#(= 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); {10435#false} is VALID [2022-04-27 13:29:09,649 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10434#true} {10472#(= main_~p~0 1)} #90#return; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,649 INFO L290 TraceCheckUtils]: 72: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,649 INFO L290 TraceCheckUtils]: 71: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,649 INFO L290 TraceCheckUtils]: 70: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,649 INFO L272 TraceCheckUtils]: 69: Hoare triple {10472#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,649 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10434#true} {10472#(= main_~p~0 1)} #88#return; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,649 INFO L290 TraceCheckUtils]: 67: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,650 INFO L290 TraceCheckUtils]: 66: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,650 INFO L290 TraceCheckUtils]: 65: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,650 INFO L272 TraceCheckUtils]: 64: Hoare triple {10472#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {10472#(= main_~p~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {10472#(= main_~p~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,650 INFO L290 TraceCheckUtils]: 61: Hoare triple {10472#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,651 INFO L290 TraceCheckUtils]: 60: Hoare triple {10747#(= (div main_~p~0 2) 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,652 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10434#true} {10747#(= (div main_~p~0 2) 1)} #90#return; {10747#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:09,652 INFO L290 TraceCheckUtils]: 58: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,652 INFO L290 TraceCheckUtils]: 57: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,652 INFO L290 TraceCheckUtils]: 56: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,652 INFO L272 TraceCheckUtils]: 55: Hoare triple {10747#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,652 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10434#true} {10747#(= (div main_~p~0 2) 1)} #88#return; {10747#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:09,652 INFO L290 TraceCheckUtils]: 53: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,652 INFO L290 TraceCheckUtils]: 52: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,652 INFO L290 TraceCheckUtils]: 51: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,653 INFO L272 TraceCheckUtils]: 50: Hoare triple {10747#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {10747#(= (div main_~p~0 2) 1)} assume !!(#t~post7 < 100);havoc #t~post7; {10747#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:09,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {10747#(= (div main_~p~0 2) 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10747#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:09,653 INFO L290 TraceCheckUtils]: 47: Hoare triple {10747#(= (div main_~p~0 2) 1)} assume !(~r~0 >= ~d~0); {10747#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:09,654 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10434#true} {10747#(= (div main_~p~0 2) 1)} #86#return; {10747#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:09,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,654 INFO L272 TraceCheckUtils]: 42: Hoare triple {10747#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,654 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10434#true} {10747#(= (div main_~p~0 2) 1)} #84#return; {10747#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:09,655 INFO L290 TraceCheckUtils]: 40: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,655 INFO L290 TraceCheckUtils]: 38: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,655 INFO L272 TraceCheckUtils]: 37: Hoare triple {10747#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,655 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10434#true} {10747#(= (div main_~p~0 2) 1)} #82#return; {10747#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:09,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,655 INFO L272 TraceCheckUtils]: 32: Hoare triple {10747#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {10747#(= (div main_~p~0 2) 1)} assume !!(#t~post6 < 100);havoc #t~post6; {10747#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:09,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {10747#(= (div main_~p~0 2) 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10747#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:09,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {10472#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10747#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:29:09,657 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10434#true} {10472#(= main_~p~0 1)} #86#return; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,657 INFO L272 TraceCheckUtils]: 24: Hoare triple {10472#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,657 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10434#true} {10472#(= main_~p~0 1)} #84#return; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,658 INFO L272 TraceCheckUtils]: 19: Hoare triple {10472#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,658 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10434#true} {10472#(= main_~p~0 1)} #82#return; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,658 INFO L272 TraceCheckUtils]: 14: Hoare triple {10472#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {10472#(= main_~p~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {10472#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {10434#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {10472#(= main_~p~0 1)} is VALID [2022-04-27 13:29:09,660 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10434#true} {10434#true} #80#return; {10434#true} is VALID [2022-04-27 13:29:09,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {10434#true} assume !(0 == ~cond); {10434#true} is VALID [2022-04-27 13:29:09,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {10434#true} ~cond := #in~cond; {10434#true} is VALID [2022-04-27 13:29:09,660 INFO L272 TraceCheckUtils]: 6: Hoare triple {10434#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {10434#true} is VALID [2022-04-27 13:29:09,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {10434#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {10434#true} is VALID [2022-04-27 13:29:09,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {10434#true} call #t~ret8 := main(); {10434#true} is VALID [2022-04-27 13:29:09,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10434#true} {10434#true} #96#return; {10434#true} is VALID [2022-04-27 13:29:09,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-27 13:29:09,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {10434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10434#true} is VALID [2022-04-27 13:29:09,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {10434#true} call ULTIMATE.init(); {10434#true} is VALID [2022-04-27 13:29:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 13:29:09,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:29:09,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395392813] [2022-04-27 13:29:09,661 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:29:09,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084281572] [2022-04-27 13:29:09,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084281572] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:29:09,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:29:09,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2022-04-27 13:29:09,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367460001] [2022-04-27 13:29:09,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:29:09,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 82 [2022-04-27 13:29:09,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:29:09,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 13:29:09,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:29:09,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:29:09,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:29:09,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:29:09,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:29:09,738 INFO L87 Difference]: Start difference. First operand 268 states and 320 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 13:29:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:10,095 INFO L93 Difference]: Finished difference Result 306 states and 366 transitions. [2022-04-27 13:29:10,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:29:10,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 82 [2022-04-27 13:29:10,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:29:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 13:29:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-27 13:29:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 13:29:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-27 13:29:10,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-27 13:29:10,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:29:10,180 INFO L225 Difference]: With dead ends: 306 [2022-04-27 13:29:10,180 INFO L226 Difference]: Without dead ends: 259 [2022-04-27 13:29:10,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:29:10,181 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:29:10,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:29:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-27 13:29:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 248. [2022-04-27 13:29:10,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:29:10,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 248 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 171 states have internal predecessors, (194), 51 states have call successors, (51), 32 states have call predecessors, (51), 30 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-27 13:29:10,334 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 248 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 171 states have internal predecessors, (194), 51 states have call successors, (51), 32 states have call predecessors, (51), 30 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-27 13:29:10,334 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 248 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 171 states have internal predecessors, (194), 51 states have call successors, (51), 32 states have call predecessors, (51), 30 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-27 13:29:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:10,341 INFO L93 Difference]: Finished difference Result 259 states and 306 transitions. [2022-04-27 13:29:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 306 transitions. [2022-04-27 13:29:10,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:10,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:10,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 248 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 171 states have internal predecessors, (194), 51 states have call successors, (51), 32 states have call predecessors, (51), 30 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) Second operand 259 states. [2022-04-27 13:29:10,342 INFO L87 Difference]: Start difference. First operand has 248 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 171 states have internal predecessors, (194), 51 states have call successors, (51), 32 states have call predecessors, (51), 30 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) Second operand 259 states. [2022-04-27 13:29:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:10,348 INFO L93 Difference]: Finished difference Result 259 states and 306 transitions. [2022-04-27 13:29:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 306 transitions. [2022-04-27 13:29:10,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:10,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:10,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:29:10,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:29:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 171 states have internal predecessors, (194), 51 states have call successors, (51), 32 states have call predecessors, (51), 30 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-27 13:29:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 293 transitions. [2022-04-27 13:29:10,361 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 293 transitions. Word has length 82 [2022-04-27 13:29:10,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:29:10,361 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 293 transitions. [2022-04-27 13:29:10,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 13:29:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 293 transitions. [2022-04-27 13:29:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 13:29:10,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:29:10,363 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:29:10,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 13:29:10,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 13:29:10,587 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:29:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:29:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash 111833757, now seen corresponding path program 1 times [2022-04-27 13:29:10,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:29:10,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948894271] [2022-04-27 13:29:10,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:29:10,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:29:10,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:29:10,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1034613083] [2022-04-27 13:29:10,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:29:10,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:29:10,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:29:10,600 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:29:10,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 13:29:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:29:10,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 13:29:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:29:10,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:29:11,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {12201#true} call ULTIMATE.init(); {12201#true} is VALID [2022-04-27 13:29:11,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {12201#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12201#true} is VALID [2022-04-27 13:29:11,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:11,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12201#true} {12201#true} #96#return; {12201#true} is VALID [2022-04-27 13:29:11,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {12201#true} call #t~ret8 := main(); {12201#true} is VALID [2022-04-27 13:29:11,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {12201#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {12201#true} is VALID [2022-04-27 13:29:11,584 INFO L272 TraceCheckUtils]: 6: Hoare triple {12201#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:11,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:11,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:11,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:11,584 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12201#true} {12201#true} #80#return; {12201#true} is VALID [2022-04-27 13:29:11,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {12201#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:11,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:11,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} assume !!(#t~post6 < 100);havoc #t~post6; {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:11,586 INFO L272 TraceCheckUtils]: 14: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:11,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:11,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:11,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:11,587 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12201#true} {12239#(= main_~d~0 (mod main_~B~0 4294967296))} #82#return; {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:11,587 INFO L272 TraceCheckUtils]: 19: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:11,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:11,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:11,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:11,587 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12201#true} {12239#(= main_~d~0 (mod main_~B~0 4294967296))} #84#return; {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:11,588 INFO L272 TraceCheckUtils]: 24: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:11,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:11,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:11,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:11,588 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12201#true} {12239#(= main_~d~0 (mod main_~B~0 4294967296))} #86#return; {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:11,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 13:29:11,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 13:29:11,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 13:29:11,591 INFO L272 TraceCheckUtils]: 32: Hoare triple {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:11,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:11,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:11,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:11,591 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12201#true} {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} #82#return; {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 13:29:11,591 INFO L272 TraceCheckUtils]: 37: Hoare triple {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:11,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:11,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:11,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:11,592 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12201#true} {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} #84#return; {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 13:29:11,592 INFO L272 TraceCheckUtils]: 42: Hoare triple {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:11,592 INFO L290 TraceCheckUtils]: 43: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:11,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:11,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:11,594 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12201#true} {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} #86#return; {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-27 13:29:11,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {12294#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !(~r~0 >= ~d~0); {12349#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-27 13:29:11,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {12349#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12349#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-27 13:29:11,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {12349#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} assume !!(#t~post7 < 100);havoc #t~post7; {12349#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-27 13:29:11,597 INFO L272 TraceCheckUtils]: 50: Hoare triple {12349#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:11,597 INFO L290 TraceCheckUtils]: 51: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:11,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:11,597 INFO L290 TraceCheckUtils]: 53: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:11,601 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12201#true} {12349#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} #88#return; {12349#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-27 13:29:11,601 INFO L272 TraceCheckUtils]: 55: Hoare triple {12349#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:11,601 INFO L290 TraceCheckUtils]: 56: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:11,601 INFO L290 TraceCheckUtils]: 57: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:11,601 INFO L290 TraceCheckUtils]: 58: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:11,602 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12201#true} {12349#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} #90#return; {12349#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-27 13:29:11,604 INFO L290 TraceCheckUtils]: 60: Hoare triple {12349#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:11,604 INFO L290 TraceCheckUtils]: 61: Hoare triple {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:11,605 INFO L290 TraceCheckUtils]: 62: Hoare triple {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:11,605 INFO L290 TraceCheckUtils]: 63: Hoare triple {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 100);havoc #t~post7; {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:11,605 INFO L272 TraceCheckUtils]: 64: Hoare triple {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:11,605 INFO L290 TraceCheckUtils]: 65: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:11,606 INFO L290 TraceCheckUtils]: 66: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:11,606 INFO L290 TraceCheckUtils]: 67: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:11,607 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12201#true} {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} #88#return; {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:11,607 INFO L272 TraceCheckUtils]: 69: Hoare triple {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:11,607 INFO L290 TraceCheckUtils]: 70: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:11,607 INFO L290 TraceCheckUtils]: 71: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:11,607 INFO L290 TraceCheckUtils]: 72: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:11,607 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12201#true} {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} #90#return; {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:11,608 INFO L290 TraceCheckUtils]: 74: Hoare triple {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} assume !(1 != ~p~0); {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:11,608 INFO L272 TraceCheckUtils]: 75: Hoare triple {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:11,608 INFO L290 TraceCheckUtils]: 76: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:11,608 INFO L290 TraceCheckUtils]: 77: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:11,608 INFO L290 TraceCheckUtils]: 78: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:11,609 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12201#true} {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} #92#return; {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:11,610 INFO L272 TraceCheckUtils]: 80: Hoare triple {12389#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {12450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:29:11,610 INFO L290 TraceCheckUtils]: 81: Hoare triple {12450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:29:11,610 INFO L290 TraceCheckUtils]: 82: Hoare triple {12454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12202#false} is VALID [2022-04-27 13:29:11,610 INFO L290 TraceCheckUtils]: 83: Hoare triple {12202#false} assume !false; {12202#false} is VALID [2022-04-27 13:29:11,611 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 13:29:11,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:29:12,243 INFO L290 TraceCheckUtils]: 83: Hoare triple {12202#false} assume !false; {12202#false} is VALID [2022-04-27 13:29:12,244 INFO L290 TraceCheckUtils]: 82: Hoare triple {12454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12202#false} is VALID [2022-04-27 13:29:12,244 INFO L290 TraceCheckUtils]: 81: Hoare triple {12450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:29:12,245 INFO L272 TraceCheckUtils]: 80: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {12450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:29:12,245 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12201#true} {12239#(= main_~d~0 (mod main_~B~0 4294967296))} #92#return; {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:12,245 INFO L290 TraceCheckUtils]: 78: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:12,245 INFO L290 TraceCheckUtils]: 77: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:12,246 INFO L290 TraceCheckUtils]: 76: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:12,246 INFO L272 TraceCheckUtils]: 75: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:12,246 INFO L290 TraceCheckUtils]: 74: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} assume !(1 != ~p~0); {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:12,246 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12201#true} {12239#(= main_~d~0 (mod main_~B~0 4294967296))} #90#return; {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:12,246 INFO L290 TraceCheckUtils]: 72: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:12,246 INFO L290 TraceCheckUtils]: 71: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:12,246 INFO L290 TraceCheckUtils]: 70: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:12,247 INFO L272 TraceCheckUtils]: 69: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:12,247 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12201#true} {12239#(= main_~d~0 (mod main_~B~0 4294967296))} #88#return; {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:12,247 INFO L290 TraceCheckUtils]: 67: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:12,247 INFO L290 TraceCheckUtils]: 66: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:12,247 INFO L290 TraceCheckUtils]: 65: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:12,247 INFO L272 TraceCheckUtils]: 64: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:12,248 INFO L290 TraceCheckUtils]: 63: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} assume !!(#t~post7 < 100);havoc #t~post7; {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:12,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:12,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {12239#(= main_~d~0 (mod main_~B~0 4294967296))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:12,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {12530#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {12239#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:12,250 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12201#true} {12530#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} #90#return; {12530#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} is VALID [2022-04-27 13:29:12,250 INFO L290 TraceCheckUtils]: 58: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:12,250 INFO L290 TraceCheckUtils]: 57: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:12,250 INFO L290 TraceCheckUtils]: 56: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:12,250 INFO L272 TraceCheckUtils]: 55: Hoare triple {12530#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:12,251 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12201#true} {12530#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} #88#return; {12530#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} is VALID [2022-04-27 13:29:12,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:12,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:12,251 INFO L290 TraceCheckUtils]: 51: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:12,251 INFO L272 TraceCheckUtils]: 50: Hoare triple {12530#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:12,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {12530#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} assume !!(#t~post7 < 100);havoc #t~post7; {12530#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} is VALID [2022-04-27 13:29:12,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {12530#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12530#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} is VALID [2022-04-27 13:29:12,253 INFO L290 TraceCheckUtils]: 47: Hoare triple {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} assume !(~r~0 >= ~d~0); {12530#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} is VALID [2022-04-27 13:29:12,254 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12201#true} {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} #86#return; {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} is VALID [2022-04-27 13:29:12,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:12,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:12,254 INFO L290 TraceCheckUtils]: 43: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:12,254 INFO L272 TraceCheckUtils]: 42: Hoare triple {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:12,254 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12201#true} {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} #84#return; {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} is VALID [2022-04-27 13:29:12,254 INFO L290 TraceCheckUtils]: 40: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:12,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:12,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:12,255 INFO L272 TraceCheckUtils]: 37: Hoare triple {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:12,255 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12201#true} {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} #82#return; {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} is VALID [2022-04-27 13:29:12,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:12,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:12,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:12,255 INFO L272 TraceCheckUtils]: 32: Hoare triple {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:12,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} assume !!(#t~post6 < 100);havoc #t~post6; {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} is VALID [2022-04-27 13:29:12,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} is VALID [2022-04-27 13:29:12,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12570#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} is VALID [2022-04-27 13:29:12,258 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12201#true} {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} #86#return; {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-27 13:29:12,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:12,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:12,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:12,258 INFO L272 TraceCheckUtils]: 24: Hoare triple {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:12,259 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12201#true} {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} #84#return; {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-27 13:29:12,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:12,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:12,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:12,259 INFO L272 TraceCheckUtils]: 19: Hoare triple {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:12,260 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12201#true} {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} #82#return; {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-27 13:29:12,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:12,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:12,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:12,260 INFO L272 TraceCheckUtils]: 14: Hoare triple {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:12,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-27 13:29:12,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-27 13:29:12,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {12201#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {12625#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-27 13:29:12,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12201#true} {12201#true} #80#return; {12201#true} is VALID [2022-04-27 13:29:12,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:12,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {12201#true} assume !(0 == ~cond); {12201#true} is VALID [2022-04-27 13:29:12,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {12201#true} ~cond := #in~cond; {12201#true} is VALID [2022-04-27 13:29:12,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {12201#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {12201#true} is VALID [2022-04-27 13:29:12,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {12201#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {12201#true} is VALID [2022-04-27 13:29:12,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {12201#true} call #t~ret8 := main(); {12201#true} is VALID [2022-04-27 13:29:12,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12201#true} {12201#true} #96#return; {12201#true} is VALID [2022-04-27 13:29:12,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {12201#true} assume true; {12201#true} is VALID [2022-04-27 13:29:12,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {12201#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12201#true} is VALID [2022-04-27 13:29:12,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {12201#true} call ULTIMATE.init(); {12201#true} is VALID [2022-04-27 13:29:12,262 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 13:29:12,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:29:12,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948894271] [2022-04-27 13:29:12,263 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:29:12,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034613083] [2022-04-27 13:29:12,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034613083] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:29:12,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:29:12,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-27 13:29:12,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032459870] [2022-04-27 13:29:12,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:29:12,264 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) Word has length 84 [2022-04-27 13:29:12,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:29:12,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:29:12,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:29:12,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 13:29:12,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:29:12,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 13:29:12,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:29:12,363 INFO L87 Difference]: Start difference. First operand 248 states and 293 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:29:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:13,594 INFO L93 Difference]: Finished difference Result 254 states and 299 transitions. [2022-04-27 13:29:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:29:13,594 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) Word has length 84 [2022-04-27 13:29:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:29:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:29:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-04-27 13:29:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:29:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-04-27 13:29:13,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 82 transitions. [2022-04-27 13:29:13,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:29:13,684 INFO L225 Difference]: With dead ends: 254 [2022-04-27 13:29:13,684 INFO L226 Difference]: Without dead ends: 229 [2022-04-27 13:29:13,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:29:13,685 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 12 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 13:29:13,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 251 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 13:29:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-04-27 13:29:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-04-27 13:29:13,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:29:13,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 229 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 158 states have internal predecessors, (180), 47 states have call successors, (47), 30 states have call predecessors, (47), 28 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:29:13,830 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 229 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 158 states have internal predecessors, (180), 47 states have call successors, (47), 30 states have call predecessors, (47), 28 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:29:13,830 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 229 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 158 states have internal predecessors, (180), 47 states have call successors, (47), 30 states have call predecessors, (47), 28 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:29:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:13,836 INFO L93 Difference]: Finished difference Result 229 states and 271 transitions. [2022-04-27 13:29:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 271 transitions. [2022-04-27 13:29:13,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:13,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:13,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 158 states have internal predecessors, (180), 47 states have call successors, (47), 30 states have call predecessors, (47), 28 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) Second operand 229 states. [2022-04-27 13:29:13,838 INFO L87 Difference]: Start difference. First operand has 229 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 158 states have internal predecessors, (180), 47 states have call successors, (47), 30 states have call predecessors, (47), 28 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) Second operand 229 states. [2022-04-27 13:29:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:13,843 INFO L93 Difference]: Finished difference Result 229 states and 271 transitions. [2022-04-27 13:29:13,843 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 271 transitions. [2022-04-27 13:29:13,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:13,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:13,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:29:13,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:29:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 158 states have internal predecessors, (180), 47 states have call successors, (47), 30 states have call predecessors, (47), 28 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:29:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 271 transitions. [2022-04-27 13:29:13,850 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 271 transitions. Word has length 84 [2022-04-27 13:29:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:29:13,850 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 271 transitions. [2022-04-27 13:29:13,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:29:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 271 transitions. [2022-04-27 13:29:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-27 13:29:13,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:29:13,852 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:29:13,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 13:29:14,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-27 13:29:14,075 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:29:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:29:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash 973212947, now seen corresponding path program 1 times [2022-04-27 13:29:14,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:29:14,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028425322] [2022-04-27 13:29:14,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:29:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:29:14,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:29:14,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46211292] [2022-04-27 13:29:14,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:29:14,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:29:14,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:29:14,101 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:29:14,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 13:29:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:29:14,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:29:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:29:14,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:29:15,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {13837#true} call ULTIMATE.init(); {13837#true} is VALID [2022-04-27 13:29:15,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {13837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13837#true} is VALID [2022-04-27 13:29:15,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {13837#true} assume true; {13837#true} is VALID [2022-04-27 13:29:15,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13837#true} {13837#true} #96#return; {13837#true} is VALID [2022-04-27 13:29:15,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {13837#true} call #t~ret8 := main(); {13837#true} is VALID [2022-04-27 13:29:15,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {13837#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {13837#true} is VALID [2022-04-27 13:29:15,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {13837#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {13837#true} is VALID [2022-04-27 13:29:15,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {13837#true} ~cond := #in~cond; {13837#true} is VALID [2022-04-27 13:29:15,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {13837#true} assume !(0 == ~cond); {13837#true} is VALID [2022-04-27 13:29:15,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {13837#true} assume true; {13837#true} is VALID [2022-04-27 13:29:15,229 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13837#true} {13837#true} #80#return; {13837#true} is VALID [2022-04-27 13:29:15,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {13837#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {13875#(<= 1 main_~p~0)} is VALID [2022-04-27 13:29:15,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {13875#(<= 1 main_~p~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13875#(<= 1 main_~p~0)} is VALID [2022-04-27 13:29:15,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {13875#(<= 1 main_~p~0)} assume !!(#t~post6 < 100);havoc #t~post6; {13875#(<= 1 main_~p~0)} is VALID [2022-04-27 13:29:15,230 INFO L272 TraceCheckUtils]: 14: Hoare triple {13875#(<= 1 main_~p~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13837#true} is VALID [2022-04-27 13:29:15,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {13837#true} ~cond := #in~cond; {13837#true} is VALID [2022-04-27 13:29:15,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {13837#true} assume !(0 == ~cond); {13837#true} is VALID [2022-04-27 13:29:15,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {13837#true} assume true; {13837#true} is VALID [2022-04-27 13:29:15,231 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13837#true} {13875#(<= 1 main_~p~0)} #82#return; {13875#(<= 1 main_~p~0)} is VALID [2022-04-27 13:29:15,231 INFO L272 TraceCheckUtils]: 19: Hoare triple {13875#(<= 1 main_~p~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13837#true} is VALID [2022-04-27 13:29:15,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {13837#true} ~cond := #in~cond; {13837#true} is VALID [2022-04-27 13:29:15,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {13837#true} assume !(0 == ~cond); {13837#true} is VALID [2022-04-27 13:29:15,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {13837#true} assume true; {13837#true} is VALID [2022-04-27 13:29:15,232 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13837#true} {13875#(<= 1 main_~p~0)} #84#return; {13875#(<= 1 main_~p~0)} is VALID [2022-04-27 13:29:15,232 INFO L272 TraceCheckUtils]: 24: Hoare triple {13875#(<= 1 main_~p~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13837#true} is VALID [2022-04-27 13:29:15,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {13837#true} ~cond := #in~cond; {13837#true} is VALID [2022-04-27 13:29:15,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {13837#true} assume !(0 == ~cond); {13837#true} is VALID [2022-04-27 13:29:15,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {13837#true} assume true; {13837#true} is VALID [2022-04-27 13:29:15,232 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13837#true} {13875#(<= 1 main_~p~0)} #86#return; {13875#(<= 1 main_~p~0)} is VALID [2022-04-27 13:29:15,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {13875#(<= 1 main_~p~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13930#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:29:15,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {13930#(<= 1 (div main_~p~0 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13930#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:29:15,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {13930#(<= 1 (div main_~p~0 2))} assume !!(#t~post6 < 100);havoc #t~post6; {13930#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:29:15,234 INFO L272 TraceCheckUtils]: 32: Hoare triple {13930#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13837#true} is VALID [2022-04-27 13:29:15,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {13837#true} ~cond := #in~cond; {13837#true} is VALID [2022-04-27 13:29:15,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {13837#true} assume !(0 == ~cond); {13837#true} is VALID [2022-04-27 13:29:15,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {13837#true} assume true; {13837#true} is VALID [2022-04-27 13:29:15,234 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13837#true} {13930#(<= 1 (div main_~p~0 2))} #82#return; {13930#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:29:15,234 INFO L272 TraceCheckUtils]: 37: Hoare triple {13930#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13837#true} is VALID [2022-04-27 13:29:15,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {13837#true} ~cond := #in~cond; {13837#true} is VALID [2022-04-27 13:29:15,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {13837#true} assume !(0 == ~cond); {13837#true} is VALID [2022-04-27 13:29:15,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {13837#true} assume true; {13837#true} is VALID [2022-04-27 13:29:15,235 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13837#true} {13930#(<= 1 (div main_~p~0 2))} #84#return; {13930#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:29:15,235 INFO L272 TraceCheckUtils]: 42: Hoare triple {13930#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13837#true} is VALID [2022-04-27 13:29:15,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {13837#true} ~cond := #in~cond; {13837#true} is VALID [2022-04-27 13:29:15,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {13837#true} assume !(0 == ~cond); {13837#true} is VALID [2022-04-27 13:29:15,235 INFO L290 TraceCheckUtils]: 45: Hoare triple {13837#true} assume true; {13837#true} is VALID [2022-04-27 13:29:15,235 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13837#true} {13930#(<= 1 (div main_~p~0 2))} #86#return; {13930#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:29:15,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {13930#(<= 1 (div main_~p~0 2))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13985#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:15,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {13985#(<= 1 (div (div main_~p~0 2) 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13985#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:15,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {13985#(<= 1 (div (div main_~p~0 2) 2))} assume !!(#t~post6 < 100);havoc #t~post6; {13985#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:15,237 INFO L272 TraceCheckUtils]: 50: Hoare triple {13985#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13837#true} is VALID [2022-04-27 13:29:15,237 INFO L290 TraceCheckUtils]: 51: Hoare triple {13837#true} ~cond := #in~cond; {13837#true} is VALID [2022-04-27 13:29:15,237 INFO L290 TraceCheckUtils]: 52: Hoare triple {13837#true} assume !(0 == ~cond); {13837#true} is VALID [2022-04-27 13:29:15,237 INFO L290 TraceCheckUtils]: 53: Hoare triple {13837#true} assume true; {13837#true} is VALID [2022-04-27 13:29:15,237 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13837#true} {13985#(<= 1 (div (div main_~p~0 2) 2))} #82#return; {13985#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:15,237 INFO L272 TraceCheckUtils]: 55: Hoare triple {13985#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13837#true} is VALID [2022-04-27 13:29:15,237 INFO L290 TraceCheckUtils]: 56: Hoare triple {13837#true} ~cond := #in~cond; {13837#true} is VALID [2022-04-27 13:29:15,237 INFO L290 TraceCheckUtils]: 57: Hoare triple {13837#true} assume !(0 == ~cond); {13837#true} is VALID [2022-04-27 13:29:15,237 INFO L290 TraceCheckUtils]: 58: Hoare triple {13837#true} assume true; {13837#true} is VALID [2022-04-27 13:29:15,238 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13837#true} {13985#(<= 1 (div (div main_~p~0 2) 2))} #84#return; {13985#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:15,238 INFO L272 TraceCheckUtils]: 60: Hoare triple {13985#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13837#true} is VALID [2022-04-27 13:29:15,238 INFO L290 TraceCheckUtils]: 61: Hoare triple {13837#true} ~cond := #in~cond; {13837#true} is VALID [2022-04-27 13:29:15,238 INFO L290 TraceCheckUtils]: 62: Hoare triple {13837#true} assume !(0 == ~cond); {13837#true} is VALID [2022-04-27 13:29:15,238 INFO L290 TraceCheckUtils]: 63: Hoare triple {13837#true} assume true; {13837#true} is VALID [2022-04-27 13:29:15,238 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13837#true} {13985#(<= 1 (div (div main_~p~0 2) 2))} #86#return; {13985#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:15,239 INFO L290 TraceCheckUtils]: 65: Hoare triple {13985#(<= 1 (div (div main_~p~0 2) 2))} assume !(~r~0 >= ~d~0); {13985#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:15,239 INFO L290 TraceCheckUtils]: 66: Hoare triple {13985#(<= 1 (div (div main_~p~0 2) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13985#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:15,239 INFO L290 TraceCheckUtils]: 67: Hoare triple {13985#(<= 1 (div (div main_~p~0 2) 2))} assume !!(#t~post7 < 100);havoc #t~post7; {13985#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:15,239 INFO L272 TraceCheckUtils]: 68: Hoare triple {13985#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {13837#true} is VALID [2022-04-27 13:29:15,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {13837#true} ~cond := #in~cond; {13837#true} is VALID [2022-04-27 13:29:15,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {13837#true} assume !(0 == ~cond); {13837#true} is VALID [2022-04-27 13:29:15,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {13837#true} assume true; {13837#true} is VALID [2022-04-27 13:29:15,240 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13837#true} {13985#(<= 1 (div (div main_~p~0 2) 2))} #88#return; {13985#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:15,240 INFO L272 TraceCheckUtils]: 73: Hoare triple {13985#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13837#true} is VALID [2022-04-27 13:29:15,240 INFO L290 TraceCheckUtils]: 74: Hoare triple {13837#true} ~cond := #in~cond; {13837#true} is VALID [2022-04-27 13:29:15,240 INFO L290 TraceCheckUtils]: 75: Hoare triple {13837#true} assume !(0 == ~cond); {13837#true} is VALID [2022-04-27 13:29:15,240 INFO L290 TraceCheckUtils]: 76: Hoare triple {13837#true} assume true; {13837#true} is VALID [2022-04-27 13:29:15,243 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {13837#true} {13985#(<= 1 (div (div main_~p~0 2) 2))} #90#return; {13985#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:29:15,244 INFO L290 TraceCheckUtils]: 78: Hoare triple {13985#(<= 1 (div (div main_~p~0 2) 2))} assume !(1 != ~p~0); {13838#false} is VALID [2022-04-27 13:29:15,244 INFO L272 TraceCheckUtils]: 79: Hoare triple {13838#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {13838#false} is VALID [2022-04-27 13:29:15,244 INFO L290 TraceCheckUtils]: 80: Hoare triple {13838#false} ~cond := #in~cond; {13838#false} is VALID [2022-04-27 13:29:15,244 INFO L290 TraceCheckUtils]: 81: Hoare triple {13838#false} assume !(0 == ~cond); {13838#false} is VALID [2022-04-27 13:29:15,244 INFO L290 TraceCheckUtils]: 82: Hoare triple {13838#false} assume true; {13838#false} is VALID [2022-04-27 13:29:15,244 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13838#false} {13838#false} #92#return; {13838#false} is VALID [2022-04-27 13:29:15,244 INFO L272 TraceCheckUtils]: 84: Hoare triple {13838#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {13838#false} is VALID [2022-04-27 13:29:15,244 INFO L290 TraceCheckUtils]: 85: Hoare triple {13838#false} ~cond := #in~cond; {13838#false} is VALID [2022-04-27 13:29:15,244 INFO L290 TraceCheckUtils]: 86: Hoare triple {13838#false} assume 0 == ~cond; {13838#false} is VALID [2022-04-27 13:29:15,245 INFO L290 TraceCheckUtils]: 87: Hoare triple {13838#false} assume !false; {13838#false} is VALID [2022-04-27 13:29:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-04-27 13:29:15,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:29:15,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:29:15,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028425322] [2022-04-27 13:29:15,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:29:15,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46211292] [2022-04-27 13:29:15,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46211292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:29:15,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:29:15,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:29:15,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489352708] [2022-04-27 13:29:15,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:29:15,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 88 [2022-04-27 13:29:15,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:29:15,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:29:15,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:29:15,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:29:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:29:15,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:29:15,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:29:15,298 INFO L87 Difference]: Start difference. First operand 229 states and 271 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:29:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:15,628 INFO L93 Difference]: Finished difference Result 249 states and 296 transitions. [2022-04-27 13:29:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:29:15,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 88 [2022-04-27 13:29:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:29:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:29:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-04-27 13:29:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:29:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-04-27 13:29:15,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 94 transitions. [2022-04-27 13:29:15,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:29:15,737 INFO L225 Difference]: With dead ends: 249 [2022-04-27 13:29:15,738 INFO L226 Difference]: Without dead ends: 228 [2022-04-27 13:29:15,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:29:15,738 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 26 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:29:15,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 101 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:29:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-04-27 13:29:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 218. [2022-04-27 13:29:15,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:29:15,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 218 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 150 states have internal predecessors, (167), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:29:15,912 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 218 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 150 states have internal predecessors, (167), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:29:15,912 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 218 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 150 states have internal predecessors, (167), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:29:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:15,917 INFO L93 Difference]: Finished difference Result 228 states and 267 transitions. [2022-04-27 13:29:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 267 transitions. [2022-04-27 13:29:15,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:15,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:15,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 150 states have internal predecessors, (167), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand 228 states. [2022-04-27 13:29:15,919 INFO L87 Difference]: Start difference. First operand has 218 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 150 states have internal predecessors, (167), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand 228 states. [2022-04-27 13:29:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:29:15,924 INFO L93 Difference]: Finished difference Result 228 states and 267 transitions. [2022-04-27 13:29:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 267 transitions. [2022-04-27 13:29:15,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:29:15,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:29:15,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:29:15,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:29:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 150 states have internal predecessors, (167), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:29:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 251 transitions. [2022-04-27 13:29:15,931 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 251 transitions. Word has length 88 [2022-04-27 13:29:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:29:15,931 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 251 transitions. [2022-04-27 13:29:15,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:29:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 251 transitions. [2022-04-27 13:29:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 13:29:15,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:29:15,932 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:29:15,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 13:29:16,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 13:29:16,147 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:29:16,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:29:16,148 INFO L85 PathProgramCache]: Analyzing trace with hash -543991253, now seen corresponding path program 3 times [2022-04-27 13:29:16,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:29:16,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684151925] [2022-04-27 13:29:16,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:29:16,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:29:16,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:29:16,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899117422] [2022-04-27 13:29:16,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:29:16,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:29:16,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:29:16,171 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:29:16,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 13:29:16,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 13:29:16,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:29:16,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-27 13:29:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:29:16,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:29:18,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {15198#true} call ULTIMATE.init(); {15198#true} is VALID [2022-04-27 13:29:18,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {15198#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15198#true} is VALID [2022-04-27 13:29:18,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {15198#true} assume true; {15198#true} is VALID [2022-04-27 13:29:18,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15198#true} {15198#true} #96#return; {15198#true} is VALID [2022-04-27 13:29:18,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {15198#true} call #t~ret8 := main(); {15198#true} is VALID [2022-04-27 13:29:18,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {15198#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {15198#true} is VALID [2022-04-27 13:29:18,546 INFO L272 TraceCheckUtils]: 6: Hoare triple {15198#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {15198#true} ~cond := #in~cond; {15224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:29:18,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {15224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:29:18,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {15228#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:29:18,547 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15228#(not (= |assume_abort_if_not_#in~cond| 0))} {15198#true} #80#return; {15235#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:29:18,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {15235#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:29:18,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:29:18,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:29:18,549 INFO L272 TraceCheckUtils]: 14: Hoare triple {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {15198#true} ~cond := #in~cond; {15198#true} is VALID [2022-04-27 13:29:18,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {15198#true} assume !(0 == ~cond); {15198#true} is VALID [2022-04-27 13:29:18,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {15198#true} assume true; {15198#true} is VALID [2022-04-27 13:29:18,549 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15198#true} {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:29:18,550 INFO L272 TraceCheckUtils]: 19: Hoare triple {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {15198#true} ~cond := #in~cond; {15198#true} is VALID [2022-04-27 13:29:18,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {15198#true} assume !(0 == ~cond); {15198#true} is VALID [2022-04-27 13:29:18,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {15198#true} assume true; {15198#true} is VALID [2022-04-27 13:29:18,550 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15198#true} {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:29:18,550 INFO L272 TraceCheckUtils]: 24: Hoare triple {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {15198#true} ~cond := #in~cond; {15198#true} is VALID [2022-04-27 13:29:18,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {15198#true} assume !(0 == ~cond); {15198#true} is VALID [2022-04-27 13:29:18,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {15198#true} assume true; {15198#true} is VALID [2022-04-27 13:29:18,551 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15198#true} {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:29:18,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {15239#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:29:18,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:29:18,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:29:18,553 INFO L272 TraceCheckUtils]: 32: Hoare triple {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {15198#true} ~cond := #in~cond; {15198#true} is VALID [2022-04-27 13:29:18,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {15198#true} assume !(0 == ~cond); {15198#true} is VALID [2022-04-27 13:29:18,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {15198#true} assume true; {15198#true} is VALID [2022-04-27 13:29:18,554 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {15198#true} {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #82#return; {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:29:18,554 INFO L272 TraceCheckUtils]: 37: Hoare triple {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {15198#true} ~cond := #in~cond; {15198#true} is VALID [2022-04-27 13:29:18,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {15198#true} assume !(0 == ~cond); {15198#true} is VALID [2022-04-27 13:29:18,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {15198#true} assume true; {15198#true} is VALID [2022-04-27 13:29:18,554 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15198#true} {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #84#return; {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:29:18,554 INFO L272 TraceCheckUtils]: 42: Hoare triple {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,554 INFO L290 TraceCheckUtils]: 43: Hoare triple {15198#true} ~cond := #in~cond; {15198#true} is VALID [2022-04-27 13:29:18,555 INFO L290 TraceCheckUtils]: 44: Hoare triple {15198#true} assume !(0 == ~cond); {15198#true} is VALID [2022-04-27 13:29:18,555 INFO L290 TraceCheckUtils]: 45: Hoare triple {15198#true} assume true; {15198#true} is VALID [2022-04-27 13:29:18,555 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15198#true} {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #86#return; {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:29:18,556 INFO L290 TraceCheckUtils]: 47: Hoare triple {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:29:18,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:29:18,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} assume !!(#t~post6 < 100);havoc #t~post6; {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:29:18,557 INFO L272 TraceCheckUtils]: 50: Hoare triple {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,557 INFO L290 TraceCheckUtils]: 51: Hoare triple {15198#true} ~cond := #in~cond; {15198#true} is VALID [2022-04-27 13:29:18,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {15198#true} assume !(0 == ~cond); {15198#true} is VALID [2022-04-27 13:29:18,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {15198#true} assume true; {15198#true} is VALID [2022-04-27 13:29:18,558 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15198#true} {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #82#return; {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:29:18,558 INFO L272 TraceCheckUtils]: 55: Hoare triple {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {15198#true} ~cond := #in~cond; {15198#true} is VALID [2022-04-27 13:29:18,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {15198#true} assume !(0 == ~cond); {15198#true} is VALID [2022-04-27 13:29:18,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {15198#true} assume true; {15198#true} is VALID [2022-04-27 13:29:18,559 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15198#true} {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #84#return; {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:29:18,559 INFO L272 TraceCheckUtils]: 60: Hoare triple {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,559 INFO L290 TraceCheckUtils]: 61: Hoare triple {15198#true} ~cond := #in~cond; {15198#true} is VALID [2022-04-27 13:29:18,559 INFO L290 TraceCheckUtils]: 62: Hoare triple {15198#true} assume !(0 == ~cond); {15198#true} is VALID [2022-04-27 13:29:18,559 INFO L290 TraceCheckUtils]: 63: Hoare triple {15198#true} assume true; {15198#true} is VALID [2022-04-27 13:29:18,559 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {15198#true} {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #86#return; {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:29:18,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:29:18,560 INFO L290 TraceCheckUtils]: 66: Hoare triple {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:29:18,561 INFO L290 TraceCheckUtils]: 67: Hoare triple {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} assume !!(#t~post7 < 100);havoc #t~post7; {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:29:18,561 INFO L272 TraceCheckUtils]: 68: Hoare triple {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,561 INFO L290 TraceCheckUtils]: 69: Hoare triple {15198#true} ~cond := #in~cond; {15198#true} is VALID [2022-04-27 13:29:18,561 INFO L290 TraceCheckUtils]: 70: Hoare triple {15198#true} assume !(0 == ~cond); {15198#true} is VALID [2022-04-27 13:29:18,561 INFO L290 TraceCheckUtils]: 71: Hoare triple {15198#true} assume true; {15198#true} is VALID [2022-04-27 13:29:18,561 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15198#true} {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #88#return; {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:29:18,561 INFO L272 TraceCheckUtils]: 73: Hoare triple {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,561 INFO L290 TraceCheckUtils]: 74: Hoare triple {15198#true} ~cond := #in~cond; {15198#true} is VALID [2022-04-27 13:29:18,562 INFO L290 TraceCheckUtils]: 75: Hoare triple {15198#true} assume !(0 == ~cond); {15198#true} is VALID [2022-04-27 13:29:18,562 INFO L290 TraceCheckUtils]: 76: Hoare triple {15198#true} assume true; {15198#true} is VALID [2022-04-27 13:29:18,562 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15198#true} {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #90#return; {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-27 13:29:18,563 INFO L290 TraceCheckUtils]: 78: Hoare triple {15349#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:29:18,564 INFO L290 TraceCheckUtils]: 79: Hoare triple {15294#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15446#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:18,565 INFO L290 TraceCheckUtils]: 80: Hoare triple {15446#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15446#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:18,565 INFO L290 TraceCheckUtils]: 81: Hoare triple {15446#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 100);havoc #t~post7; {15446#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:18,565 INFO L272 TraceCheckUtils]: 82: Hoare triple {15446#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,565 INFO L290 TraceCheckUtils]: 83: Hoare triple {15198#true} ~cond := #in~cond; {15198#true} is VALID [2022-04-27 13:29:18,565 INFO L290 TraceCheckUtils]: 84: Hoare triple {15198#true} assume !(0 == ~cond); {15198#true} is VALID [2022-04-27 13:29:18,565 INFO L290 TraceCheckUtils]: 85: Hoare triple {15198#true} assume true; {15198#true} is VALID [2022-04-27 13:29:18,566 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {15198#true} {15446#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} #88#return; {15446#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:18,566 INFO L272 TraceCheckUtils]: 87: Hoare triple {15446#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15198#true} is VALID [2022-04-27 13:29:18,566 INFO L290 TraceCheckUtils]: 88: Hoare triple {15198#true} ~cond := #in~cond; {15474#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:29:18,574 INFO L290 TraceCheckUtils]: 89: Hoare triple {15474#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:29:18,574 INFO L290 TraceCheckUtils]: 90: Hoare triple {15478#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:29:18,575 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15478#(not (= |__VERIFIER_assert_#in~cond| 0))} {15446#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} #90#return; {15446#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:29:18,576 INFO L290 TraceCheckUtils]: 92: Hoare triple {15446#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15488#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= main_~q~0 2) (<= 1 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* 2 (mod main_~B~0 4294967296)))) (= main_~p~0 1))} is VALID [2022-04-27 13:29:18,578 INFO L290 TraceCheckUtils]: 93: Hoare triple {15488#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= main_~q~0 2) (<= 1 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* 2 (mod main_~B~0 4294967296)))) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15492#(and (= main_~r~0 (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296) (* (- 2) (mod main_~B~0 4294967296)))) (<= 1 (mod main_~B~0 4294967296)) (= (+ (- 2) main_~q~0) 1))} is VALID [2022-04-27 13:29:18,578 INFO L290 TraceCheckUtils]: 94: Hoare triple {15492#(and (= main_~r~0 (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296) (* (- 2) (mod main_~B~0 4294967296)))) (<= 1 (mod main_~B~0 4294967296)) (= (+ (- 2) main_~q~0) 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15492#(and (= main_~r~0 (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296) (* (- 2) (mod main_~B~0 4294967296)))) (<= 1 (mod main_~B~0 4294967296)) (= (+ (- 2) main_~q~0) 1))} is VALID [2022-04-27 13:29:18,579 INFO L290 TraceCheckUtils]: 95: Hoare triple {15492#(and (= main_~r~0 (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296) (* (- 2) (mod main_~B~0 4294967296)))) (<= 1 (mod main_~B~0 4294967296)) (= (+ (- 2) main_~q~0) 1))} assume !!(#t~post7 < 100);havoc #t~post7; {15492#(and (= main_~r~0 (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296) (* (- 2) (mod main_~B~0 4294967296)))) (<= 1 (mod main_~B~0 4294967296)) (= (+ (- 2) main_~q~0) 1))} is VALID [2022-04-27 13:29:18,580 INFO L272 TraceCheckUtils]: 96: Hoare triple {15492#(and (= main_~r~0 (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296) (* (- 2) (mod main_~B~0 4294967296)))) (<= 1 (mod main_~B~0 4294967296)) (= (+ (- 2) main_~q~0) 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {15502#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:29:18,580 INFO L290 TraceCheckUtils]: 97: Hoare triple {15502#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15506#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:29:18,580 INFO L290 TraceCheckUtils]: 98: Hoare triple {15506#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15199#false} is VALID [2022-04-27 13:29:18,580 INFO L290 TraceCheckUtils]: 99: Hoare triple {15199#false} assume !false; {15199#false} is VALID [2022-04-27 13:29:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 61 proven. 31 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-27 13:29:18,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:30:02,786 WARN L232 SmtUtils]: Spent 14.51s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:31:39,557 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse28 (< c_main_~d~0 0)) (.cse4 (= (mod c_main_~d~0 2) 0)) (.cse2 (div c_main_~d~0 2))) (let ((.cse8 (mod c_main_~A~0 4294967296)) (.cse3 (+ .cse2 1)) (.cse0 (and .cse28 (not .cse4))) (.cse15 (= (mod c_main_~p~0 2) 0)) (.cse16 (< c_main_~p~0 0)) (.cse13 (mod c_main_~B~0 4294967296)) (.cse17 (div c_main_~p~0 2))) (and (let ((.cse14 (+ .cse17 1))) (let ((.cse1 (* .cse14 .cse13))) (or (and (or .cse0 (not (= .cse1 .cse2))) (or (not (= .cse3 .cse1)) .cse4)) (let ((.cse12 (div .cse14 2)) (.cse9 (= (mod .cse14 2) 0))) (let ((.cse10 (not .cse9)) (.cse11 (* (+ c_main_~q~0 .cse12) .cse13)) (.cse6 (* (- 1) (div .cse1 2))) (.cse7 (* (+ c_main_~q~0 .cse12 1) .cse13)) (.cse5 (= (mod .cse1 2) 0))) (and (or (not .cse5) (and (or (= (+ .cse6 c_main_~r~0 .cse7) .cse8) .cse9) (or .cse10 (= .cse8 (+ .cse6 .cse11 c_main_~r~0))))) (or (and (or .cse10 (= (+ (- 1) .cse6 .cse11 c_main_~r~0) .cse8)) (or (= (+ (- 1) .cse6 c_main_~r~0 .cse7) .cse8) .cse9)) .cse5)))) .cse15 (not .cse16)))) (let ((.cse26 (* .cse13 .cse17))) (or (let ((.cse24 (= (mod .cse17 2) 0)) (.cse27 (div .cse17 2))) (let ((.cse18 (= (mod .cse26 2) 0)) (.cse22 (* (+ c_main_~q~0 .cse27) .cse13)) (.cse20 (not .cse24)) (.cse25 (* (+ c_main_~q~0 .cse27 1) .cse13)) (.cse23 (* (- 1) (div .cse26 2))) (.cse19 (< .cse26 0))) (and (or (and (not .cse18) .cse19) (let ((.cse21 (< .cse17 0))) (and (or (and .cse20 .cse21) (= .cse8 (+ .cse22 .cse23 c_main_~r~0))) (or (not .cse21) .cse24 (= (+ .cse25 .cse23 c_main_~r~0) .cse8))))) (or .cse18 (and (or (= (+ (- 1) .cse22 .cse23 c_main_~r~0) .cse8) .cse20) (or .cse24 (= .cse8 (+ (- 1) .cse25 .cse23 c_main_~r~0)))) (not .cse19))))) (and (or (not (= .cse3 .cse26)) .cse4 (not .cse28)) (or .cse0 (not (= .cse2 .cse26)))) (and (not .cse15) .cse16)))))) is different from false [2022-04-27 13:31:41,560 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse28 (< c_main_~d~0 0)) (.cse4 (= (mod c_main_~d~0 2) 0)) (.cse2 (div c_main_~d~0 2))) (let ((.cse8 (mod c_main_~A~0 4294967296)) (.cse3 (+ .cse2 1)) (.cse0 (and .cse28 (not .cse4))) (.cse15 (= (mod c_main_~p~0 2) 0)) (.cse16 (< c_main_~p~0 0)) (.cse13 (mod c_main_~B~0 4294967296)) (.cse17 (div c_main_~p~0 2))) (and (let ((.cse14 (+ .cse17 1))) (let ((.cse1 (* .cse14 .cse13))) (or (and (or .cse0 (not (= .cse1 .cse2))) (or (not (= .cse3 .cse1)) .cse4)) (let ((.cse12 (div .cse14 2)) (.cse9 (= (mod .cse14 2) 0))) (let ((.cse10 (not .cse9)) (.cse11 (* (+ c_main_~q~0 .cse12) .cse13)) (.cse6 (* (- 1) (div .cse1 2))) (.cse7 (* (+ c_main_~q~0 .cse12 1) .cse13)) (.cse5 (= (mod .cse1 2) 0))) (and (or (not .cse5) (and (or (= (+ .cse6 c_main_~r~0 .cse7) .cse8) .cse9) (or .cse10 (= .cse8 (+ .cse6 .cse11 c_main_~r~0))))) (or (and (or .cse10 (= (+ (- 1) .cse6 .cse11 c_main_~r~0) .cse8)) (or (= (+ (- 1) .cse6 c_main_~r~0 .cse7) .cse8) .cse9)) .cse5)))) .cse15 (not .cse16)))) (let ((.cse26 (* .cse13 .cse17))) (or (let ((.cse24 (= (mod .cse17 2) 0)) (.cse27 (div .cse17 2))) (let ((.cse18 (= (mod .cse26 2) 0)) (.cse22 (* (+ c_main_~q~0 .cse27) .cse13)) (.cse20 (not .cse24)) (.cse25 (* (+ c_main_~q~0 .cse27 1) .cse13)) (.cse23 (* (- 1) (div .cse26 2))) (.cse19 (< .cse26 0))) (and (or (and (not .cse18) .cse19) (let ((.cse21 (< .cse17 0))) (and (or (and .cse20 .cse21) (= .cse8 (+ .cse22 .cse23 c_main_~r~0))) (or (not .cse21) .cse24 (= (+ .cse25 .cse23 c_main_~r~0) .cse8))))) (or .cse18 (and (or (= (+ (- 1) .cse22 .cse23 c_main_~r~0) .cse8) .cse20) (or .cse24 (= .cse8 (+ (- 1) .cse25 .cse23 c_main_~r~0)))) (not .cse19))))) (and (or (not (= .cse3 .cse26)) .cse4 (not .cse28)) (or .cse0 (not (= .cse2 .cse26)))) (and (not .cse15) .cse16)))))) is different from true