/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:17:34,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:17:34,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:17:34,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:17:34,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:17:34,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:17:34,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:17:34,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:17:34,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:17:34,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:17:34,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:17:34,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:17:34,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:17:34,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:17:34,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:17:34,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:17:34,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:17:34,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:17:34,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:17:34,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:17:34,107 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:17:34,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:17:34,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:17:34,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:17:34,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:17:34,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:17:34,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:17:34,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:17:34,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:17:34,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:17:34,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:17:34,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:17:34,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:17:34,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:17:34,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:17:34,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:17:34,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:17:34,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:17:34,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:17:34,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:17:34,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:17:34,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:17:34,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 14:17:34,128 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:17:34,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:17:34,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:17:34,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:17:34,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:17:34,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:17:34,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:17:34,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:17:34,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:17:34,130 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:17:34,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:17:34,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:17:34,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:17:34,131 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:17:34,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:17:34,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:17:34,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:17:34,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:17:34,131 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:17:34,131 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:17:34,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:17:34,132 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:17:34,132 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 14:17:34,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:17:34,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:17:34,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:17:34,345 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:17:34,346 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:17:34,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound2.i [2022-04-15 14:17:34,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0468d45/6b81730dcff04526b1468815f675bd50/FLAG0988d4b3f [2022-04-15 14:17:34,752 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:17:34,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound2.i [2022-04-15 14:17:34,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0468d45/6b81730dcff04526b1468815f675bd50/FLAG0988d4b3f [2022-04-15 14:17:34,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0468d45/6b81730dcff04526b1468815f675bd50 [2022-04-15 14:17:34,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:17:34,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:17:34,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:17:34,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:17:34,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:17:34,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:17:34" (1/1) ... [2022-04-15 14:17:34,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4153ae0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:34, skipping insertion in model container [2022-04-15 14:17:34,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:17:34" (1/1) ... [2022-04-15 14:17:34,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:17:34,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:17:34,904 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/divbin2_valuebound2.i[951,964] [2022-04-15 14:17:34,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:17:34,917 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:17:34,935 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/divbin2_valuebound2.i[951,964] [2022-04-15 14:17:34,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:17:34,947 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:17:34,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:34 WrapperNode [2022-04-15 14:17:34,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:17:34,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:17:34,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:17:34,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:17:34,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:34" (1/1) ... [2022-04-15 14:17:34,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:34" (1/1) ... [2022-04-15 14:17:34,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:34" (1/1) ... [2022-04-15 14:17:34,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:34" (1/1) ... [2022-04-15 14:17:34,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:34" (1/1) ... [2022-04-15 14:17:34,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:34" (1/1) ... [2022-04-15 14:17:34,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:34" (1/1) ... [2022-04-15 14:17:34,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:17:34,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:17:34,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:17:34,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:17:34,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:34" (1/1) ... [2022-04-15 14:17:34,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:17:34,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:17:35,021 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-15 14:17:35,032 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-15 14:17:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:17:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:17:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:17:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:17:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:17:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:17:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:17:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:17:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 14:17:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 14:17:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:17:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:17:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 14:17:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:17:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:17:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:17:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:17:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:17:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:17:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:17:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:17:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:17:35,088 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:17:35,089 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:17:35,228 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:17:35,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:17:35,233 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:17:35,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:17:35 BoogieIcfgContainer [2022-04-15 14:17:35,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:17:35,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:17:35,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:17:35,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:17:35,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:17:34" (1/3) ... [2022-04-15 14:17:35,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d2c780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:17:35, skipping insertion in model container [2022-04-15 14:17:35,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:17:34" (2/3) ... [2022-04-15 14:17:35,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d2c780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:17:35, skipping insertion in model container [2022-04-15 14:17:35,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:17:35" (3/3) ... [2022-04-15 14:17:35,255 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound2.i [2022-04-15 14:17:35,276 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:17:35,276 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:17:35,313 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:17:35,317 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 14:17:35,318 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:17:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:17:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 14:17:35,377 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:17:35,378 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:17:35,378 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:17:35,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:17:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 1 times [2022-04-15 14:17:35,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:35,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2014191696] [2022-04-15 14:17:35,395 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:17:35,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 2 times [2022-04-15 14:17:35,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:17:35,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829990276] [2022-04-15 14:17:35,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:35,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:17:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:35,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:17:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:35,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#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); {33#true} is VALID [2022-04-15 14:17:35,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 14:17:35,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-15 14:17:35,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:17:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:35,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 14:17:35,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-15 14:17:35,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-15 14:17:35,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-15 14:17:35,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:17:35,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#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); {33#true} is VALID [2022-04-15 14:17:35,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 14:17:35,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-15 14:17:35,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2022-04-15 14:17:35,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2022-04-15 14:17:35,526 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {33#true} is VALID [2022-04-15 14:17:35,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 14:17:35,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-15 14:17:35,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-15 14:17:35,527 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-15 14:17:35,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {34#false} is VALID [2022-04-15 14:17:35,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-15 14:17:35,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-15 14:17:35,527 INFO L272 TraceCheckUtils]: 14: Hoare triple {34#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {34#false} is VALID [2022-04-15 14:17:35,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-15 14:17:35,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-15 14:17:35,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-15 14:17:35,528 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-15 14:17:35,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:17:35,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829990276] [2022-04-15 14:17:35,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829990276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:35,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:35,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:17:35,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:17:35,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2014191696] [2022-04-15 14:17:35,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2014191696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:35,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:35,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:17:35,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679023871] [2022-04-15 14:17:35,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:17:35,536 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-15 14:17:35,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:17:35,539 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-15 14:17:35,557 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-15 14:17:35,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:17:35,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:35,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:17:35,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:17:35,575 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-15 14:17:35,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:35,707 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-15 14:17:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:17:35,708 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-15 14:17:35,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:17:35,709 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-15 14:17:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 14:17:35,720 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-15 14:17:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 14:17:35,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-15 14:17:35,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:17:35,820 INFO L225 Difference]: With dead ends: 51 [2022-04-15 14:17:35,820 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 14:17:35,822 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:17:35,825 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:17:35,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:17:35,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 14:17:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 14:17:35,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:17:35,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 14:17:35,849 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 14:17:35,849 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 14:17:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:35,852 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 14:17:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 14:17:35,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:35,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:35,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 14:17:35,854 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 14:17:35,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:35,856 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 14:17:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 14:17:35,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:35,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:35,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:17:35,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:17:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 14:17:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-15 14:17:35,860 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-15 14:17:35,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:17:35,860 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-15 14:17:35,860 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:17:35,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-15 14:17:35,886 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-15 14:17:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 14:17:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 14:17:35,887 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:17:35,887 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:17:35,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:17:35,887 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:17:35,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:17:35,888 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 1 times [2022-04-15 14:17:35,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:35,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1949862745] [2022-04-15 14:17:35,889 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:17:35,889 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 2 times [2022-04-15 14:17:35,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:17:35,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659191981] [2022-04-15 14:17:35,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:35,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:17:35,902 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:17:35,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [389040136] [2022-04-15 14:17:35,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:17:35,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:17:35,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:17:35,904 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-15 14:17:35,905 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-15 14:17:35,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:17:35,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:17:35,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 14:17:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:35,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:17:36,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2022-04-15 14:17:36,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#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); {247#true} is VALID [2022-04-15 14:17:36,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#true} assume true; {247#true} is VALID [2022-04-15 14:17:36,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} #84#return; {247#true} is VALID [2022-04-15 14:17:36,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {247#true} call #t~ret2 := main(); {247#true} is VALID [2022-04-15 14:17:36,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {247#true} is VALID [2022-04-15 14:17:36,288 INFO L272 TraceCheckUtils]: 6: Hoare triple {247#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {247#true} is VALID [2022-04-15 14:17:36,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {247#true} ~cond := #in~cond; {247#true} is VALID [2022-04-15 14:17:36,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#true} assume !(0 == ~cond); {247#true} is VALID [2022-04-15 14:17:36,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {247#true} assume true; {247#true} is VALID [2022-04-15 14:17:36,289 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {247#true} {247#true} #78#return; {247#true} is VALID [2022-04-15 14:17:36,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {247#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:17:36,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:17:36,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {292#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:17:36,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {292#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:17:36,295 INFO L272 TraceCheckUtils]: 15: Hoare triple {292#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {299#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:17:36,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {299#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {303#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:17:36,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {303#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {248#false} is VALID [2022-04-15 14:17:36,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {248#false} assume !false; {248#false} is VALID [2022-04-15 14:17:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 14:17:36,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:17:36,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:17:36,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659191981] [2022-04-15 14:17:36,298 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:17:36,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389040136] [2022-04-15 14:17:36,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389040136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:36,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:36,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:17:36,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:17:36,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1949862745] [2022-04-15 14:17:36,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1949862745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:36,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:36,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:17:36,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104352064] [2022-04-15 14:17:36,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:17:36,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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 19 [2022-04-15 14:17:36,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:17:36,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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-15 14:17:36,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:17:36,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:17:36,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:36,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:17:36,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 14:17:36,321 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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-15 14:17:36,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:36,516 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 14:17:36,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:17:36,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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 19 [2022-04-15 14:17:36,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:17:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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-15 14:17:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 14:17:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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-15 14:17:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 14:17:36,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-15 14:17:36,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:17:36,554 INFO L225 Difference]: With dead ends: 37 [2022-04-15 14:17:36,555 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 14:17:36,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:17:36,556 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:17:36,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:17:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 14:17:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 14:17:36,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:17:36,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:17:36,568 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:17:36,568 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:17:36,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:36,570 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 14:17:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 14:17:36,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:36,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:36,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 14:17:36,571 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 14:17:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:36,573 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 14:17:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 14:17:36,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:36,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:36,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:17:36,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:17:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:17:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-15 14:17:36,576 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-15 14:17:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:17:36,576 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-15 14:17:36,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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-15 14:17:36,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-15 14:17:36,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:17:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 14:17:36,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 14:17:36,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:17:36,615 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:17:36,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 14:17:36,826 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:17:36,826 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:17:36,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:17:36,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 1 times [2022-04-15 14:17:36,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:36,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1501690020] [2022-04-15 14:17:36,891 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 14:17:36,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2069278597, now seen corresponding path program 1 times [2022-04-15 14:17:36,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:17:36,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886488141] [2022-04-15 14:17:36,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:36,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:17:36,901 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:17:36,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1218353729] [2022-04-15 14:17:36,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:36,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:17:36,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:17:36,902 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-15 14:17:36,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 14:17:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:36,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 14:17:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:36,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:17:37,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {521#true} call ULTIMATE.init(); {521#true} is VALID [2022-04-15 14:17:37,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {521#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); {521#true} is VALID [2022-04-15 14:17:37,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {521#true} assume true; {521#true} is VALID [2022-04-15 14:17:37,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {521#true} {521#true} #84#return; {521#true} is VALID [2022-04-15 14:17:37,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {521#true} call #t~ret2 := main(); {521#true} is VALID [2022-04-15 14:17:37,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {521#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {521#true} is VALID [2022-04-15 14:17:37,196 INFO L272 TraceCheckUtils]: 6: Hoare triple {521#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {521#true} is VALID [2022-04-15 14:17:37,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {521#true} ~cond := #in~cond; {547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:17:37,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:17:37,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:17:37,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {551#(not (= |assume_abort_if_not_#in~cond| 0))} {521#true} #78#return; {558#(<= (mod main_~A~0 4294967296) 2)} is VALID [2022-04-15 14:17:37,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {558#(<= (mod main_~A~0 4294967296) 2)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-15 14:17:37,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} [88] L34-2-->L35_primed: Formula: (or (= v_main_~r~0_In_1 v_main_~r~0_In_1) (and (= v_main_~r~0_In_1 0) (= (mod v_main_~b~0_Out_2 2) 0) (<= (mod (div (- v_main_~b~0_Out_2) (- 2)) 4294967296) (mod v_main_~r~0_In_1 4294967296)))) InVars {main_~r~0=v_main_~r~0_In_1} OutVars{main_~b~0=v_main_~b~0_Out_2, main_~r~0=v_main_~r~0_In_1} AuxVars[] AssignedVars[main_~b~0] {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-15 14:17:37,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} [87] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-15 14:17:37,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-15 14:17:37,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} assume !false; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-15 14:17:37,201 INFO L272 TraceCheckUtils]: 16: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:17:37,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:17:37,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {522#false} is VALID [2022-04-15 14:17:37,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {522#false} assume !false; {522#false} is VALID [2022-04-15 14:17:37,202 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-15 14:17:37,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:17:37,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:17:37,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886488141] [2022-04-15 14:17:37,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:17:37,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218353729] [2022-04-15 14:17:37,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218353729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:37,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:37,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:17:37,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:17:37,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1501690020] [2022-04-15 14:17:37,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1501690020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:37,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:37,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 14:17:37,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057179595] [2022-04-15 14:17:37,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:17:37,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 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 21 [2022-04-15 14:17:37,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:17:37,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 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-15 14:17:37,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:17:37,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 14:17:37,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:37,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 14:17:37,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:17:37,261 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 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-15 14:17:39,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:17:41,683 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:17:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:41,981 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-15 14:17:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 14:17:41,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 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 21 [2022-04-15 14:17:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:17:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 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-15 14:17:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 14:17:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 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-15 14:17:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 14:17:41,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-15 14:17:42,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:17:42,041 INFO L225 Difference]: With dead ends: 49 [2022-04-15 14:17:42,041 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 14:17:42,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 14:17:42,042 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 14:17:42,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 106 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 14:17:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 14:17:42,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-04-15 14:17:42,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:17:42,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:17:42,061 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:17:42,061 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:17:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:42,063 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 14:17:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 14:17:42,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:42,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:42,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-04-15 14:17:42,064 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-04-15 14:17:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:42,066 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 14:17:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 14:17:42,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:42,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:42,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:17:42,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:17:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:17:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-15 14:17:42,068 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2022-04-15 14:17:42,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:17:42,068 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-15 14:17:42,069 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 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-15 14:17:42,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-15 14:17:42,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:17:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 14:17:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 14:17:42,114 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:17:42,114 INFO L499 BasicCegarLoop]: trace histogram [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-15 14:17:42,131 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-15 14:17:42,315 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 14:17:42,315 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:17:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:17:42,316 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 1 times [2022-04-15 14:17:42,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:42,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [945665469] [2022-04-15 14:17:42,316 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 14:17:42,316 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 2 times [2022-04-15 14:17:42,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:17:42,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386506534] [2022-04-15 14:17:42,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:42,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:17:42,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:17:42,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [3029870] [2022-04-15 14:17:42,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:17:42,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:17:42,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:17:42,348 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-15 14:17:42,350 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-15 14:17:42,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:17:42,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:17:42,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 14:17:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:42,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:17:42,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {847#true} call ULTIMATE.init(); {847#true} is VALID [2022-04-15 14:17:42,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {847#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); {847#true} is VALID [2022-04-15 14:17:42,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {847#true} assume true; {847#true} is VALID [2022-04-15 14:17:42,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {847#true} {847#true} #84#return; {847#true} is VALID [2022-04-15 14:17:42,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {847#true} call #t~ret2 := main(); {847#true} is VALID [2022-04-15 14:17:42,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {847#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {847#true} is VALID [2022-04-15 14:17:42,469 INFO L272 TraceCheckUtils]: 6: Hoare triple {847#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {847#true} is VALID [2022-04-15 14:17:42,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {847#true} ~cond := #in~cond; {847#true} is VALID [2022-04-15 14:17:42,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {847#true} assume !(0 == ~cond); {847#true} is VALID [2022-04-15 14:17:42,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {847#true} assume true; {847#true} is VALID [2022-04-15 14:17:42,471 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {847#true} {847#true} #78#return; {847#true} is VALID [2022-04-15 14:17:42,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {847#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:17:42,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:17:42,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:17:42,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:17:42,473 INFO L272 TraceCheckUtils]: 15: Hoare triple {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {847#true} is VALID [2022-04-15 14:17:42,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {847#true} ~cond := #in~cond; {847#true} is VALID [2022-04-15 14:17:42,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {847#true} assume !(0 == ~cond); {847#true} is VALID [2022-04-15 14:17:42,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {847#true} assume true; {847#true} is VALID [2022-04-15 14:17:42,474 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {847#true} {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #80#return; {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:17:42,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {848#false} is VALID [2022-04-15 14:17:42,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {848#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {848#false} is VALID [2022-04-15 14:17:42,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {848#false} assume !false; {848#false} is VALID [2022-04-15 14:17:42,476 INFO L272 TraceCheckUtils]: 23: Hoare triple {848#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {848#false} is VALID [2022-04-15 14:17:42,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {848#false} ~cond := #in~cond; {848#false} is VALID [2022-04-15 14:17:42,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {848#false} assume 0 == ~cond; {848#false} is VALID [2022-04-15 14:17:42,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {848#false} assume !false; {848#false} is VALID [2022-04-15 14:17:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 14:17:42,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:17:42,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:17:42,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386506534] [2022-04-15 14:17:42,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:17:42,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3029870] [2022-04-15 14:17:42,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3029870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:42,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:42,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:17:42,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:17:42,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [945665469] [2022-04-15 14:17:42,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [945665469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:17:42,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:17:42,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:17:42,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337426886] [2022-04-15 14:17:42,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:17:42,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-15 14:17:42,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:17:42,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:17:42,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:17:42,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:17:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:42,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:17:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:17:42,500 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:17:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:42,616 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-15 14:17:42,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:17:42,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-15 14:17:42,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:17:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:17:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-15 14:17:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:17:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-15 14:17:42,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-15 14:17:42,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:17:42,653 INFO L225 Difference]: With dead ends: 57 [2022-04-15 14:17:42,653 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 14:17:42,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-15 14:17:42,654 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:17:42,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:17:42,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 14:17:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 14:17:42,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:17:42,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:17:42,672 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:17:42,672 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:17:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:42,673 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 14:17:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 14:17:42,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:42,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:42,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-15 14:17:42,674 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-15 14:17:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:17:42,675 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 14:17:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 14:17:42,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:17:42,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:17:42,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:17:42,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:17:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:17:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-15 14:17:42,676 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2022-04-15 14:17:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:17:42,676 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-15 14:17:42,676 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:17:42,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-15 14:17:42,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:17:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 14:17:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 14:17:42,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:17:42,728 INFO L499 BasicCegarLoop]: trace histogram [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-15 14:17:42,776 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-15 14:17:42,928 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:17:42,928 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:17:42,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:17:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 1 times [2022-04-15 14:17:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:17:42,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [480729840] [2022-04-15 14:17:42,973 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 14:17:42,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1205839047, now seen corresponding path program 1 times [2022-04-15 14:17:42,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:17:42,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157511547] [2022-04-15 14:17:42,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:42,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:17:42,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:17:42,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1585488140] [2022-04-15 14:17:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:17:42,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:17:42,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:17:42,992 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-15 14:17:43,016 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-15 14:17:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:17:43,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 14:17:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 14:17:45,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:18:13,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {1184#true} call ULTIMATE.init(); {1184#true} is VALID [2022-04-15 14:18:13,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#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); {1184#true} is VALID [2022-04-15 14:18:13,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {1184#true} assume true; {1184#true} is VALID [2022-04-15 14:18:13,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1184#true} {1184#true} #84#return; {1184#true} is VALID [2022-04-15 14:18:13,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {1184#true} call #t~ret2 := main(); {1184#true} is VALID [2022-04-15 14:18:13,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {1184#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1184#true} is VALID [2022-04-15 14:18:13,140 INFO L272 TraceCheckUtils]: 6: Hoare triple {1184#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {1184#true} is VALID [2022-04-15 14:18:13,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {1184#true} ~cond := #in~cond; {1210#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:18:13,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {1210#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1214#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:18:13,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {1214#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1214#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:18:13,143 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1214#(not (= |assume_abort_if_not_#in~cond| 0))} {1184#true} #78#return; {1221#(<= (mod main_~A~0 4294967296) 2)} is VALID [2022-04-15 14:18:13,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {1221#(<= (mod main_~A~0 4294967296) 2)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-15 14:18:13,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (<= (mod main_~A~0 4294967296) 2))} [90] L34-2-->L35_primed: Formula: (or (and (= (mod v_main_~b~0_Out_4 2) 0) (= v_main_~r~0_In_2 0) (<= (mod (div (- v_main_~b~0_Out_4) (- 2)) 4294967296) (mod v_main_~r~0_In_2 4294967296))) (= v_main_~r~0_In_2 v_main_~r~0_In_2)) InVars {main_~r~0=v_main_~r~0_In_2} OutVars{main_~b~0=v_main_~b~0_Out_4, main_~r~0=v_main_~r~0_In_2} AuxVars[] AssignedVars[main_~b~0] {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-15 14:18:13,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (<= (mod main_~A~0 4294967296) 2))} [89] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-15 14:18:13,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (<= (mod main_~A~0 4294967296) 2))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1235#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-15 14:18:13,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {1235#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (<= (mod main_~A~0 4294967296) 2))} assume !false; {1235#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-15 14:18:13,147 INFO L272 TraceCheckUtils]: 16: Hoare triple {1235#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (<= (mod main_~A~0 4294967296) 2))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1184#true} is VALID [2022-04-15 14:18:13,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {1184#true} ~cond := #in~cond; {1184#true} is VALID [2022-04-15 14:18:13,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {1184#true} assume !(0 == ~cond); {1184#true} is VALID [2022-04-15 14:18:13,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {1184#true} assume true; {1184#true} is VALID [2022-04-15 14:18:13,148 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1184#true} {1235#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (<= (mod main_~A~0 4294967296) 2))} #80#return; {1235#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-15 14:18:15,266 WARN L290 TraceCheckUtils]: 21: Hoare triple {1235#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (<= (mod main_~A~0 4294967296) 2))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1257#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (* main_~b~0 2) 4294967296) (<= (mod main_~A~0 4294967296) 2) (< 0 (+ 2 (* main_~b~0 2))) (< (div (+ (- 1) (* main_~b~0 2)) (- 4294967296)) (+ (div (+ (* (- 2) main_~b~0) 4294967295) 4294967296) 1)))} is UNKNOWN [2022-04-15 14:18:15,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {1257#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (* main_~b~0 2) 4294967296) (<= (mod main_~A~0 4294967296) 2) (< 0 (+ 2 (* main_~b~0 2))) (< (div (+ (- 1) (* main_~b~0 2)) (- 4294967296)) (+ (div (+ (* (- 2) main_~b~0) 4294967295) 4294967296) 1)))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1261#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (<= (mod main_~b~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (- 1) main_~q~0) 0) (< (* main_~b~0 2) 4294967296) (<= (mod main_~A~0 4294967296) 2) (< 0 (+ 2 (* main_~b~0 2))) (< (div (+ (- 1) (* main_~b~0 2)) (- 4294967296)) (+ (div (+ (* (- 2) main_~b~0) 4294967295) 4294967296) 1)))} is VALID [2022-04-15 14:18:15,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {1261#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (<= (mod main_~b~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (- 1) main_~q~0) 0) (< (* main_~b~0 2) 4294967296) (<= (mod main_~A~0 4294967296) 2) (< 0 (+ 2 (* main_~b~0 2))) (< (div (+ (- 1) (* main_~b~0 2)) (- 4294967296)) (+ (div (+ (* (- 2) main_~b~0) 4294967295) 4294967296) 1)))} assume !false; {1261#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (<= (mod main_~b~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (- 1) main_~q~0) 0) (< (* main_~b~0 2) 4294967296) (<= (mod main_~A~0 4294967296) 2) (< 0 (+ 2 (* main_~b~0 2))) (< (div (+ (- 1) (* main_~b~0 2)) (- 4294967296)) (+ (div (+ (* (- 2) main_~b~0) 4294967295) 4294967296) 1)))} is VALID [2022-04-15 14:18:15,271 INFO L272 TraceCheckUtils]: 24: Hoare triple {1261#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (<= (mod main_~b~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (- 1) main_~q~0) 0) (< (* main_~b~0 2) 4294967296) (<= (mod main_~A~0 4294967296) 2) (< 0 (+ 2 (* main_~b~0 2))) (< (div (+ (- 1) (* main_~b~0 2)) (- 4294967296)) (+ (div (+ (* (- 2) main_~b~0) 4294967295) 4294967296) 1)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:18:15,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:18:15,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1185#false} is VALID [2022-04-15 14:18:15,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {1185#false} assume !false; {1185#false} is VALID [2022-04-15 14:18:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 14:18:15,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:18:17,534 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~b~0 4294967296))) (let ((.cse0 (div .cse1 2))) (or (not (<= (mod .cse0 4294967296) (mod c_main_~r~0 4294967296))) (= (mod c_main_~B~0 4294967296) .cse1) (= (mod c_main_~A~0 4294967296) (mod (+ (* .cse0 (+ (* c_main_~q~0 2) 1)) (* .cse0 4294967295) c_main_~r~0) 4294967296))))) is different from false [2022-04-15 14:25:10,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {1185#false} assume !false; {1185#false} is VALID [2022-04-15 14:25:10,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1185#false} is VALID [2022-04-15 14:25:10,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:25:10,598 INFO L272 TraceCheckUtils]: 24: Hoare triple {1288#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:25:10,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {1288#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {1288#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-15 14:25:12,608 WARN L290 TraceCheckUtils]: 22: Hoare triple {1295#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 (+ main_~q~0 1)) (* main_~b~0 4294967295)) 4294967296)))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1288#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-15 14:25:14,613 WARN L290 TraceCheckUtils]: 21: Hoare triple {1299#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (not (<= (mod (div (mod main_~b~0 4294967296) 2) 4294967296) (mod main_~r~0 4294967296))) (= (mod main_~A~0 4294967296) (mod (+ (* (div (mod main_~b~0 4294967296) 2) 4294967295) main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (+ (* main_~q~0 2) 1))) 4294967296)))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1295#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 (+ main_~q~0 1)) (* main_~b~0 4294967295)) 4294967296)))} is UNKNOWN [2022-04-15 14:25:14,615 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1184#true} {1299#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (not (<= (mod (div (mod main_~b~0 4294967296) 2) 4294967296) (mod main_~r~0 4294967296))) (= (mod main_~A~0 4294967296) (mod (+ (* (div (mod main_~b~0 4294967296) 2) 4294967295) main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (+ (* main_~q~0 2) 1))) 4294967296)))} #80#return; {1299#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (not (<= (mod (div (mod main_~b~0 4294967296) 2) 4294967296) (mod main_~r~0 4294967296))) (= (mod main_~A~0 4294967296) (mod (+ (* (div (mod main_~b~0 4294967296) 2) 4294967295) main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (+ (* main_~q~0 2) 1))) 4294967296)))} is VALID [2022-04-15 14:25:14,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {1184#true} assume true; {1184#true} is VALID [2022-04-15 14:25:14,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {1184#true} assume !(0 == ~cond); {1184#true} is VALID [2022-04-15 14:25:14,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {1184#true} ~cond := #in~cond; {1184#true} is VALID [2022-04-15 14:25:14,615 INFO L272 TraceCheckUtils]: 16: Hoare triple {1299#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (not (<= (mod (div (mod main_~b~0 4294967296) 2) 4294967296) (mod main_~r~0 4294967296))) (= (mod main_~A~0 4294967296) (mod (+ (* (div (mod main_~b~0 4294967296) 2) 4294967295) main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (+ (* main_~q~0 2) 1))) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1184#true} is VALID [2022-04-15 14:25:14,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {1299#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (not (<= (mod (div (mod main_~b~0 4294967296) 2) 4294967296) (mod main_~r~0 4294967296))) (= (mod main_~A~0 4294967296) (mod (+ (* (div (mod main_~b~0 4294967296) 2) 4294967295) main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (+ (* main_~q~0 2) 1))) 4294967296)))} assume !false; {1299#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (not (<= (mod (div (mod main_~b~0 4294967296) 2) 4294967296) (mod main_~r~0 4294967296))) (= (mod main_~A~0 4294967296) (mod (+ (* (div (mod main_~b~0 4294967296) 2) 4294967295) main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (+ (* main_~q~0 2) 1))) 4294967296)))} is VALID [2022-04-15 14:25:16,773 WARN L290 TraceCheckUtils]: 14: Hoare triple {1321#(and (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 Int) (aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129 Int)) (or (<= (+ (mod main_~r~0 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 4294967298) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648)) (<= 2147483648 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) (<= 0 aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129) (= (mod main_~A~0 4294967296) (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) 2147483649 main_~r~0 (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648) (* (+ (* main_~q~0 2) 1) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) (- 2147483649) (* (- 1) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648))) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 4294967296)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129 2147483648) (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648)) (+ (div (+ (- 1) (mod main_~B~0 4294967296)) 2) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 1)) (<= (+ (* 2 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 8589934594) (+ (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 4294967296))) (<= 0 (div (+ (mod main_~r~0 4294967296) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 4294967297 (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 (- 4294967296)) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 (- 4294967296))) 4294967296)) (<= aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2))) (forall ((aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 Int) (aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 Int) (aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 Int)) (or (<= 0 (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 (- 4294967296)) 8589934589 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) (* (- 8589934592) aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (* (- 1) (mod main_~r~0 4294967296)) (* (- 2) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) (- 4294967296))) 4294967296)) (= (mod (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 2147483648) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) main_~r~0 4294967295 (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 4294967295) (* (mod main_~r~0 4294967296) 4294967295) (* (+ (* main_~q~0 2) 1) (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* (- 2147483648) aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90) (- 4294967295) (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)))) 4294967296) (mod main_~A~0 4294967296)) (<= 2147483648 aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242) (<= (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) 12884901886) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 4294967296) (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 2) (* (mod main_~r~0 4294967296) 2) (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268))) (<= (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 4294967296) (- 8589934590) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 (- 4294967296)) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 4294967296) (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 2) (* (mod main_~r~0 4294967296) 2) (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 2147483648) (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)) (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) (* aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 4294967296) 6442450942)) (<= 2 aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (<= aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 (+ aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 1)) (<= (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)) 2147483646) (<= 2 aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790))))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1299#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (not (<= (mod (div (mod main_~b~0 4294967296) 2) 4294967296) (mod main_~r~0 4294967296))) (= (mod main_~A~0 4294967296) (mod (+ (* (div (mod main_~b~0 4294967296) 2) 4294967295) main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (+ (* main_~q~0 2) 1))) 4294967296)))} is UNKNOWN [2022-04-15 14:25:16,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {1321#(and (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 Int) (aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129 Int)) (or (<= (+ (mod main_~r~0 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 4294967298) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648)) (<= 2147483648 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) (<= 0 aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129) (= (mod main_~A~0 4294967296) (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) 2147483649 main_~r~0 (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648) (* (+ (* main_~q~0 2) 1) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) (- 2147483649) (* (- 1) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648))) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 4294967296)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129 2147483648) (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648)) (+ (div (+ (- 1) (mod main_~B~0 4294967296)) 2) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 1)) (<= (+ (* 2 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 8589934594) (+ (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 4294967296))) (<= 0 (div (+ (mod main_~r~0 4294967296) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 4294967297 (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 (- 4294967296)) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 (- 4294967296))) 4294967296)) (<= aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2))) (forall ((aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 Int) (aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 Int) (aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 Int)) (or (<= 0 (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 (- 4294967296)) 8589934589 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) (* (- 8589934592) aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (* (- 1) (mod main_~r~0 4294967296)) (* (- 2) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) (- 4294967296))) 4294967296)) (= (mod (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 2147483648) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) main_~r~0 4294967295 (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 4294967295) (* (mod main_~r~0 4294967296) 4294967295) (* (+ (* main_~q~0 2) 1) (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* (- 2147483648) aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90) (- 4294967295) (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)))) 4294967296) (mod main_~A~0 4294967296)) (<= 2147483648 aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242) (<= (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) 12884901886) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 4294967296) (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 2) (* (mod main_~r~0 4294967296) 2) (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268))) (<= (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 4294967296) (- 8589934590) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 (- 4294967296)) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 4294967296) (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 2) (* (mod main_~r~0 4294967296) 2) (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 2147483648) (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)) (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) (* aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 4294967296) 6442450942)) (<= 2 aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (<= aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 (+ aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 1)) (<= (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)) 2147483646) (<= 2 aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790))))} [89] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#(and (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 Int) (aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129 Int)) (or (<= (+ (mod main_~r~0 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 4294967298) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648)) (<= 2147483648 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) (<= 0 aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129) (= (mod main_~A~0 4294967296) (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) 2147483649 main_~r~0 (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648) (* (+ (* main_~q~0 2) 1) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) (- 2147483649) (* (- 1) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648))) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 4294967296)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129 2147483648) (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648)) (+ (div (+ (- 1) (mod main_~B~0 4294967296)) 2) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 1)) (<= (+ (* 2 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 8589934594) (+ (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 4294967296))) (<= 0 (div (+ (mod main_~r~0 4294967296) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 4294967297 (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 (- 4294967296)) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 (- 4294967296))) 4294967296)) (<= aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2))) (forall ((aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 Int) (aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 Int) (aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 Int)) (or (<= 0 (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 (- 4294967296)) 8589934589 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) (* (- 8589934592) aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (* (- 1) (mod main_~r~0 4294967296)) (* (- 2) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) (- 4294967296))) 4294967296)) (= (mod (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 2147483648) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) main_~r~0 4294967295 (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 4294967295) (* (mod main_~r~0 4294967296) 4294967295) (* (+ (* main_~q~0 2) 1) (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* (- 2147483648) aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90) (- 4294967295) (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)))) 4294967296) (mod main_~A~0 4294967296)) (<= 2147483648 aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242) (<= (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) 12884901886) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 4294967296) (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 2) (* (mod main_~r~0 4294967296) 2) (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268))) (<= (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 4294967296) (- 8589934590) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 (- 4294967296)) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 4294967296) (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 2) (* (mod main_~r~0 4294967296) 2) (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 2147483648) (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)) (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) (* aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 4294967296) 6442450942)) (<= 2 aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (<= aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 (+ aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 1)) (<= (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)) 2147483646) (<= 2 aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790))))} is VALID [2022-04-15 14:25:16,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {1321#(and (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 Int) (aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129 Int)) (or (<= (+ (mod main_~r~0 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 4294967298) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648)) (<= 2147483648 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) (<= 0 aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129) (= (mod main_~A~0 4294967296) (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) 2147483649 main_~r~0 (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648) (* (+ (* main_~q~0 2) 1) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) (- 2147483649) (* (- 1) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648))) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 4294967296)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129 2147483648) (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648)) (+ (div (+ (- 1) (mod main_~B~0 4294967296)) 2) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 1)) (<= (+ (* 2 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 8589934594) (+ (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 4294967296))) (<= 0 (div (+ (mod main_~r~0 4294967296) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 4294967297 (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 (- 4294967296)) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 (- 4294967296))) 4294967296)) (<= aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2))) (forall ((aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 Int) (aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 Int) (aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 Int)) (or (<= 0 (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 (- 4294967296)) 8589934589 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) (* (- 8589934592) aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (* (- 1) (mod main_~r~0 4294967296)) (* (- 2) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) (- 4294967296))) 4294967296)) (= (mod (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 2147483648) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) main_~r~0 4294967295 (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 4294967295) (* (mod main_~r~0 4294967296) 4294967295) (* (+ (* main_~q~0 2) 1) (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* (- 2147483648) aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90) (- 4294967295) (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)))) 4294967296) (mod main_~A~0 4294967296)) (<= 2147483648 aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242) (<= (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) 12884901886) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 4294967296) (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 2) (* (mod main_~r~0 4294967296) 2) (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268))) (<= (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 4294967296) (- 8589934590) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 (- 4294967296)) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 4294967296) (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 2) (* (mod main_~r~0 4294967296) 2) (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 2147483648) (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)) (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) (* aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 4294967296) 6442450942)) (<= 2 aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (<= aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 (+ aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 1)) (<= (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)) 2147483646) (<= 2 aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790))))} [90] L34-2-->L35_primed: Formula: (or (and (= (mod v_main_~b~0_Out_4 2) 0) (= v_main_~r~0_In_2 0) (<= (mod (div (- v_main_~b~0_Out_4) (- 2)) 4294967296) (mod v_main_~r~0_In_2 4294967296))) (= v_main_~r~0_In_2 v_main_~r~0_In_2)) InVars {main_~r~0=v_main_~r~0_In_2} OutVars{main_~b~0=v_main_~b~0_Out_4, main_~r~0=v_main_~r~0_In_2} AuxVars[] AssignedVars[main_~b~0] {1321#(and (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 Int) (aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129 Int)) (or (<= (+ (mod main_~r~0 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 4294967298) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648)) (<= 2147483648 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) (<= 0 aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129) (= (mod main_~A~0 4294967296) (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) 2147483649 main_~r~0 (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648) (* (+ (* main_~q~0 2) 1) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) (- 2147483649) (* (- 1) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648))) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 4294967296)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129 2147483648) (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648)) (+ (div (+ (- 1) (mod main_~B~0 4294967296)) 2) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 1)) (<= (+ (* 2 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 8589934594) (+ (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 4294967296))) (<= 0 (div (+ (mod main_~r~0 4294967296) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 4294967297 (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 (- 4294967296)) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 (- 4294967296))) 4294967296)) (<= aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2))) (forall ((aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 Int) (aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 Int) (aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 Int)) (or (<= 0 (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 (- 4294967296)) 8589934589 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) (* (- 8589934592) aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (* (- 1) (mod main_~r~0 4294967296)) (* (- 2) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) (- 4294967296))) 4294967296)) (= (mod (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 2147483648) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) main_~r~0 4294967295 (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 4294967295) (* (mod main_~r~0 4294967296) 4294967295) (* (+ (* main_~q~0 2) 1) (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* (- 2147483648) aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90) (- 4294967295) (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)))) 4294967296) (mod main_~A~0 4294967296)) (<= 2147483648 aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242) (<= (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) 12884901886) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 4294967296) (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 2) (* (mod main_~r~0 4294967296) 2) (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268))) (<= (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 4294967296) (- 8589934590) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 (- 4294967296)) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 4294967296) (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 2) (* (mod main_~r~0 4294967296) 2) (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 2147483648) (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)) (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) (* aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 4294967296) 6442450942)) (<= 2 aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (<= aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 (+ aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 1)) (<= (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)) 2147483646) (<= 2 aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790))))} is VALID [2022-04-15 14:25:16,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {1184#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1321#(and (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 Int) (aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129 Int)) (or (<= (+ (mod main_~r~0 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 4294967298) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648)) (<= 2147483648 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) (<= 0 aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129) (= (mod main_~A~0 4294967296) (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) 2147483649 main_~r~0 (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648) (* (+ (* main_~q~0 2) 1) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) (- 2147483649) (* (- 1) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648))) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 4294967296)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2147483648) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129 2147483648) (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 2147483648)) (+ (div (+ (- 1) (mod main_~B~0 4294967296)) 2) aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 1)) (<= (+ (* 2 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 8589934594) (+ (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 4294967296))) (<= 0 (div (+ (mod main_~r~0 4294967296) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176) 4294967297 (* aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244 (- 4294967296)) (* aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 (- 4294967296))) 4294967296)) (<= aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_129_232_244_176 2))) (forall ((aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 Int) (aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 Int) (aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 Int)) (or (<= 0 (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 (- 4294967296)) 8589934589 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) (* (- 8589934592) aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (* (- 1) (mod main_~r~0 4294967296)) (* (- 2) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) (- 4294967296))) 4294967296)) (= (mod (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 2147483648) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) main_~r~0 4294967295 (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 4294967295) (* (mod main_~r~0 4294967296) 4294967295) (* (+ (* main_~q~0 2) 1) (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* (- 2147483648) aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90) (- 4294967295) (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)))) 4294967296) (mod main_~A~0 4294967296)) (<= 2147483648 aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242) (<= (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) 12884901886) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 4294967296) (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 2) (* (mod main_~r~0 4294967296) 2) (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268))) (<= (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 4294967296) (- 8589934590) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 (- 4294967296)) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 4294967296) (* aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 2) (* (mod main_~r~0 4294967296) 2) (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 2147483648) (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)) (+ (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90 4294967296) (* aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 4294967296) 6442450942)) (<= 2 aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268) (<= aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790 (+ aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 1)) (<= (+ (mod main_~r~0 4294967296) (* (div (+ (mod main_~r~0 4294967296) 1 (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 2147483648) (* aux_mod_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268 2147483648) aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242 (* 4294967296 aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_242_268)) 2147483646) (<= 2 aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_main_~b~0_26_37_48_50_90_169_790))))} is VALID [2022-04-15 14:25:16,782 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1184#true} {1184#true} #78#return; {1184#true} is VALID [2022-04-15 14:25:16,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {1184#true} assume true; {1184#true} is VALID [2022-04-15 14:25:16,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {1184#true} assume !(0 == ~cond); {1184#true} is VALID [2022-04-15 14:25:16,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {1184#true} ~cond := #in~cond; {1184#true} is VALID [2022-04-15 14:25:16,782 INFO L272 TraceCheckUtils]: 6: Hoare triple {1184#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {1184#true} is VALID [2022-04-15 14:25:16,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {1184#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1184#true} is VALID [2022-04-15 14:25:16,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {1184#true} call #t~ret2 := main(); {1184#true} is VALID [2022-04-15 14:25:16,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1184#true} {1184#true} #84#return; {1184#true} is VALID [2022-04-15 14:25:16,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {1184#true} assume true; {1184#true} is VALID [2022-04-15 14:25:16,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#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); {1184#true} is VALID [2022-04-15 14:25:16,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {1184#true} call ULTIMATE.init(); {1184#true} is VALID [2022-04-15 14:25:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-04-15 14:25:16,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:25:16,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157511547] [2022-04-15 14:25:16,783 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:25:16,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585488140] [2022-04-15 14:25:16,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585488140] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:25:16,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:25:16,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2022-04-15 14:25:16,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:25:16,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [480729840] [2022-04-15 14:25:16,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [480729840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:25:16,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:25:16,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 14:25:16,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719555617] [2022-04-15 14:25:16,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:25:16,856 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-15 14:25:16,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:25:16,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:25:16,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:25:16,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 14:25:16,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:25:16,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 14:25:16,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=162, Unknown=1, NotChecked=26, Total=240 [2022-04-15 14:25:16,931 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:25:20,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:25:24,478 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:25:26,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:25:28,734 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:25:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:25:31,047 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-15 14:25:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 14:25:31,048 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-15 14:25:31,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:25:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:25:31,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-15 14:25:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:25:31,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-15 14:25:31,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-15 14:25:31,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:25:31,603 INFO L225 Difference]: With dead ends: 77 [2022-04-15 14:25:31,603 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 14:25:31,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=89, Invalid=294, Unknown=1, NotChecked=36, Total=420 [2022-04-15 14:25:31,605 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 14 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-04-15 14:25:31,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 119 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 152 Invalid, 4 Unknown, 0 Unchecked, 10.4s Time] [2022-04-15 14:25:31,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 14:25:31,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-15 14:25:31,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:25:31,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 14:25:31,667 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 14:25:31,667 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 14:25:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:25:31,669 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-04-15 14:25:31,669 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-15 14:25:31,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:25:31,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:25:31,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 55 states. [2022-04-15 14:25:31,670 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 55 states. [2022-04-15 14:25:31,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:25:31,671 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-04-15 14:25:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-15 14:25:31,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:25:31,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:25:31,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:25:31,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:25:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 14:25:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-04-15 14:25:31,673 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 29 [2022-04-15 14:25:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:25:31,673 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-04-15 14:25:31,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:25:31,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 60 transitions. [2022-04-15 14:25:32,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:25:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-15 14:25:32,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 14:25:32,049 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:25:32,049 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:25:32,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 14:25:32,250 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:25:32,250 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:25:32,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:25:32,250 INFO L85 PathProgramCache]: Analyzing trace with hash -758101483, now seen corresponding path program 2 times [2022-04-15 14:25:32,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:25:32,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1225713103] [2022-04-15 14:25:32,297 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 14:25:32,298 INFO L85 PathProgramCache]: Analyzing trace with hash 56536339, now seen corresponding path program 1 times [2022-04-15 14:25:32,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:25:32,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765214229] [2022-04-15 14:25:32,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:25:32,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:25:32,308 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:25:32,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [223359679] [2022-04-15 14:25:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:25:32,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:25:32,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:25:32,319 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-15 14:25:32,326 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-15 14:25:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:25:32,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 14:25:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 14:25:34,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:26:42,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {1749#true} call ULTIMATE.init(); {1749#true} is VALID [2022-04-15 14:26:42,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {1749#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); {1749#true} is VALID [2022-04-15 14:26:42,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {1749#true} assume true; {1749#true} is VALID [2022-04-15 14:26:42,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1749#true} {1749#true} #84#return; {1749#true} is VALID [2022-04-15 14:26:42,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {1749#true} call #t~ret2 := main(); {1749#true} is VALID [2022-04-15 14:26:42,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {1749#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1749#true} is VALID [2022-04-15 14:26:42,013 INFO L272 TraceCheckUtils]: 6: Hoare triple {1749#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {1749#true} is VALID [2022-04-15 14:26:42,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {1749#true} ~cond := #in~cond; {1775#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:26:42,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1779#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:26:42,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {1779#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1779#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:26:42,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1779#(not (= |assume_abort_if_not_#in~cond| 0))} {1749#true} #78#return; {1786#(<= (mod main_~A~0 4294967296) 2)} is VALID [2022-04-15 14:26:42,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {1786#(<= (mod main_~A~0 4294967296) 2)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1790#(and (= main_~B~0 1) (<= (mod main_~r~0 4294967296) 2))} is VALID [2022-04-15 14:26:42,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {1790#(and (= main_~B~0 1) (<= (mod main_~r~0 4294967296) 2))} [92] L34-2-->L35_primed: Formula: (or (and (= v_main_~r~0_In_3 0) (= (mod v_main_~b~0_Out_6 2) 0) (<= (mod (div v_main_~b~0_Out_6 2) 4294967296) (mod v_main_~r~0_In_3 4294967296))) (= v_main_~r~0_In_3 v_main_~r~0_In_3)) InVars {main_~r~0=v_main_~r~0_In_3} OutVars{main_~b~0=v_main_~b~0_Out_6, main_~r~0=v_main_~r~0_In_3} AuxVars[] AssignedVars[main_~b~0] {1790#(and (= main_~B~0 1) (<= (mod main_~r~0 4294967296) 2))} is VALID [2022-04-15 14:26:42,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {1790#(and (= main_~B~0 1) (<= (mod main_~r~0 4294967296) 2))} [91] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1790#(and (= main_~B~0 1) (<= (mod main_~r~0 4294967296) 2))} is VALID [2022-04-15 14:26:42,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {1790#(and (= main_~B~0 1) (<= (mod main_~r~0 4294967296) 2))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1800#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~B~0 1) (<= (mod main_~r~0 4294967296) 2))} is VALID [2022-04-15 14:26:42,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {1800#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~B~0 1) (<= (mod main_~r~0 4294967296) 2))} assume !false; {1800#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~B~0 1) (<= (mod main_~r~0 4294967296) 2))} is VALID [2022-04-15 14:26:42,030 INFO L272 TraceCheckUtils]: 16: Hoare triple {1800#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~B~0 1) (<= (mod main_~r~0 4294967296) 2))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1749#true} is VALID [2022-04-15 14:26:42,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {1749#true} ~cond := #in~cond; {1749#true} is VALID [2022-04-15 14:26:42,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {1749#true} assume !(0 == ~cond); {1749#true} is VALID [2022-04-15 14:26:42,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {1749#true} assume true; {1749#true} is VALID [2022-04-15 14:26:42,031 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1749#true} {1800#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~B~0 1) (<= (mod main_~r~0 4294967296) 2))} #80#return; {1800#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~B~0 1) (<= (mod main_~r~0 4294967296) 2))} is VALID [2022-04-15 14:26:42,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {1800#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~B~0 1) (<= (mod main_~r~0 4294967296) 2))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1822#(and (= main_~B~0 1) (< (div (+ (* main_~b~0 2) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 1) (< (* main_~b~0 2) 4294967296) (<= (mod main_~r~0 4294967296) 2))} is VALID [2022-04-15 14:26:42,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {1822#(and (= main_~B~0 1) (< (div (+ (* main_~b~0 2) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 1) (< (* main_~b~0 2) 4294967296) (<= (mod main_~r~0 4294967296) 2))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1826#(and (<= (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (<= (mod main_~b~0 4294967296) (mod (+ main_~b~0 main_~r~0) 4294967296)) (= main_~B~0 1) (< (div (+ (* main_~b~0 2) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 1) (< (* main_~b~0 2) 4294967296))} is VALID [2022-04-15 14:26:42,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {1826#(and (<= (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (<= (mod main_~b~0 4294967296) (mod (+ main_~b~0 main_~r~0) 4294967296)) (= main_~B~0 1) (< (div (+ (* main_~b~0 2) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 1) (< (* main_~b~0 2) 4294967296))} assume !false; {1826#(and (<= (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (<= (mod main_~b~0 4294967296) (mod (+ main_~b~0 main_~r~0) 4294967296)) (= main_~B~0 1) (< (div (+ (* main_~b~0 2) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 1) (< (* main_~b~0 2) 4294967296))} is VALID [2022-04-15 14:26:42,035 INFO L272 TraceCheckUtils]: 24: Hoare triple {1826#(and (<= (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (<= (mod main_~b~0 4294967296) (mod (+ main_~b~0 main_~r~0) 4294967296)) (= main_~B~0 1) (< (div (+ (* main_~b~0 2) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 1) (< (* main_~b~0 2) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1749#true} is VALID [2022-04-15 14:26:42,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {1749#true} ~cond := #in~cond; {1749#true} is VALID [2022-04-15 14:26:42,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {1749#true} assume !(0 == ~cond); {1749#true} is VALID [2022-04-15 14:26:42,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {1749#true} assume true; {1749#true} is VALID [2022-04-15 14:26:42,036 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1749#true} {1826#(and (<= (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (<= (mod main_~b~0 4294967296) (mod (+ main_~b~0 main_~r~0) 4294967296)) (= main_~B~0 1) (< (div (+ (* main_~b~0 2) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 1) (< (* main_~b~0 2) 4294967296))} #80#return; {1826#(and (<= (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (<= (mod main_~b~0 4294967296) (mod (+ main_~b~0 main_~r~0) 4294967296)) (= main_~B~0 1) (< (div (+ (* main_~b~0 2) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 1) (< (* main_~b~0 2) 4294967296))} is VALID [2022-04-15 14:26:42,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {1826#(and (<= (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (<= (mod main_~b~0 4294967296) (mod (+ main_~b~0 main_~r~0) 4294967296)) (= main_~B~0 1) (< (div (+ (* main_~b~0 2) (* (- 1) (mod main_~B~0 4294967296))) (- 4294967296)) 1) (< (* main_~b~0 2) 4294967296))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1848#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 Int) (aux_div_aux_mod_v_main_~b~0_32_45_71 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 Int) (aux_div_v_main_~b~0_32_45 Int) (aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67 Int)) (and (<= (* main_~r~0 4294967295) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296)) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 2)) (+ (* main_~r~0 4294967296) 4294967296)) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* main_~b~0 2)) 4294967296) (< (+ (* 8589934592 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75) (* 8589934592 aux_div_v_main_~b~0_32_45) (* aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 2) (* 8589934592 aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93) (* 8589934592 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 4) (* 8589934592 aux_div_aux_mod_v_main_~b~0_32_45_71)) (+ (* 17179869184 main_~r~0) 4294967296)) (<= 0 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* main_~b~0 2))) (<= (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296) (* aux_div_aux_mod_v_main_~b~0_32_45_71 4294967296) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 2)) (+ (* main_~r~0 8589934591) 2)) (<= 0 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* main_~b~0 2))) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77) (<= (* main_~r~0 8589934591) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296) (* aux_div_aux_mod_v_main_~b~0_32_45_71 4294967296) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 2))) (<= (* main_~r~0 4294967296) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 2))) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 2) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296) (* main_~b~0 2)) (+ 4294967296 (* main_~r~0 4294967295))) (< (div (+ (- 1) (* 8589934592 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75) (* 8589934592 aux_div_v_main_~b~0_32_45) (* aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 2) (* (- 17179869184) main_~r~0) (* 8589934592 aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93) (* 8589934592 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 4) (* 8589934592 aux_div_aux_mod_v_main_~b~0_32_45_71)) (- 4294967296)) 1) (not (= (+ (* main_~r~0 4294967296) 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 2))))))} is VALID [2022-04-15 14:26:43,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {1848#(exists ((aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 Int) (aux_div_aux_mod_v_main_~b~0_32_45_71 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 Int) (aux_div_v_main_~b~0_32_45 Int) (aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67 Int)) (and (<= (* main_~r~0 4294967295) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296)) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 2)) (+ (* main_~r~0 4294967296) 4294967296)) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* main_~b~0 2)) 4294967296) (< (+ (* 8589934592 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75) (* 8589934592 aux_div_v_main_~b~0_32_45) (* aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 2) (* 8589934592 aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93) (* 8589934592 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 4) (* 8589934592 aux_div_aux_mod_v_main_~b~0_32_45_71)) (+ (* 17179869184 main_~r~0) 4294967296)) (<= 0 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* main_~b~0 2))) (<= (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296) (* aux_div_aux_mod_v_main_~b~0_32_45_71 4294967296) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 2)) (+ (* main_~r~0 8589934591) 2)) (<= 0 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* main_~b~0 2))) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77) (<= (* main_~r~0 8589934591) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296) (* aux_div_aux_mod_v_main_~b~0_32_45_71 4294967296) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 2))) (<= (* main_~r~0 4294967296) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 2))) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 2) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296) (* main_~b~0 2)) (+ 4294967296 (* main_~r~0 4294967295))) (< (div (+ (- 1) (* 8589934592 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75) (* 8589934592 aux_div_v_main_~b~0_32_45) (* aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 2) (* (- 17179869184) main_~r~0) (* 8589934592 aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93) (* 8589934592 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 4) (* 8589934592 aux_div_aux_mod_v_main_~b~0_32_45_71)) (- 4294967296)) 1) (not (= (+ (* main_~r~0 4294967296) 1) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75_77 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93_75 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_32_45_71_67_93 4294967296) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~b~0_32_45_71_67) (* main_~b~0 2))))))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1750#false} is VALID [2022-04-15 14:26:43,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {1750#false} assume !false; {1750#false} is VALID [2022-04-15 14:26:43,021 INFO L272 TraceCheckUtils]: 32: Hoare triple {1750#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1750#false} is VALID [2022-04-15 14:26:43,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {1750#false} ~cond := #in~cond; {1750#false} is VALID [2022-04-15 14:26:43,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {1750#false} assume 0 == ~cond; {1750#false} is VALID [2022-04-15 14:26:43,021 INFO L290 TraceCheckUtils]: 35: Hoare triple {1750#false} assume !false; {1750#false} is VALID [2022-04-15 14:26:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:26:43,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:26:45,284 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~b~0 4294967296))) (or (not (<= (mod (div .cse0 2) 4294967296) (mod c_main_~r~0 4294967296))) (= (mod c_main_~B~0 4294967296) .cse0))) is different from false [2022-04-15 14:26:52,798 WARN L232 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 7 (called from [L1074] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-15 14:27:00,034 WARN L232 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L1074] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-15 14:27:13,449 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_main_~b~0 4294967296))) (let ((.cse1 (div .cse3 2))) (let ((.cse0 (mod .cse1 4294967296)) (.cse2 (mod c_main_~B~0 4294967296))) (or (not (<= .cse0 (mod c_main_~r~0 4294967296))) (not (<= (mod (div .cse0 2) 4294967296) (mod (+ (* .cse1 4294967295) c_main_~r~0) 4294967296))) (= .cse2 .cse3) (= .cse0 .cse2))))) is different from false [2022-04-15 14:27:15,599 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_main_~b~0 4294967296))) (let ((.cse1 (div .cse3 2))) (let ((.cse0 (mod .cse1 4294967296)) (.cse2 (mod c_main_~B~0 4294967296))) (or (not (<= .cse0 (mod c_main_~r~0 4294967296))) (not (<= (mod (div .cse0 2) 4294967296) (mod (+ (* .cse1 4294967295) c_main_~r~0) 4294967296))) (= .cse2 .cse3) (= .cse0 .cse2))))) is different from true [2022-04-15 14:27:25,073 WARN L232 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1074] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)