/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 19:00:46,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 19:00:46,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 19:00:46,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 19:00:46,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 19:00:46,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 19:00:46,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 19:00:46,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 19:00:46,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 19:00:46,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 19:00:46,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 19:00:46,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 19:00:46,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 19:00:46,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 19:00:46,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 19:00:46,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 19:00:46,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 19:00:46,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 19:00:46,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 19:00:46,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 19:00:46,204 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 19:00:46,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 19:00:46,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 19:00:46,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 19:00:46,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 19:00:46,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 19:00:46,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 19:00:46,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 19:00:46,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 19:00:46,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 19:00:46,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 19:00:46,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 19:00:46,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 19:00:46,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 19:00:46,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 19:00:46,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 19:00:46,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 19:00:46,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 19:00:46,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 19:00:46,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 19:00:46,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 19:00:46,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 19:00:46,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 19:00:46,228 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 19:00:46,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 19:00:46,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 19:00:46,229 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 19:00:46,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 19:00:46,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 19:00:46,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 19:00:46,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 19:00:46,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 19:00:46,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 19:00:46,229 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 19:00:46,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 19:00:46,230 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 19:00:46,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 19:00:46,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 19:00:46,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 19:00:46,230 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 19:00:46,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 19:00:46,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 19:00:46,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 19:00:46,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 19:00:46,231 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 19:00:46,231 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 19:00:46,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 19:00:46,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 19:00:46,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 19:00:46,421 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 19:00:46,421 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 19:00:46,422 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound100.c [2022-04-27 19:00:46,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08065f23d/8c79fc5d22fe41d9842853c72791e73a/FLAG990558b49 [2022-04-27 19:00:46,837 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 19:00:46,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound100.c [2022-04-27 19:00:46,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08065f23d/8c79fc5d22fe41d9842853c72791e73a/FLAG990558b49 [2022-04-27 19:00:46,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08065f23d/8c79fc5d22fe41d9842853c72791e73a [2022-04-27 19:00:46,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 19:00:46,858 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 19:00:46,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 19:00:46,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 19:00:46,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 19:00:46,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 07:00:46" (1/1) ... [2022-04-27 19:00:46,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49e85ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:00:46, skipping insertion in model container [2022-04-27 19:00:46,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 07:00:46" (1/1) ... [2022-04-27 19:00:46,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 19:00:46,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 19:00:47,015 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound100.c[537,550] [2022-04-27 19:00:47,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 19:00:47,046 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 19:00:47,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound100.c[537,550] [2022-04-27 19:00:47,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 19:00:47,066 INFO L208 MainTranslator]: Completed translation [2022-04-27 19:00:47,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:00:47 WrapperNode [2022-04-27 19:00:47,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 19:00:47,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 19:00:47,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 19:00:47,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 19:00:47,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:00:47" (1/1) ... [2022-04-27 19:00:47,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:00:47" (1/1) ... [2022-04-27 19:00:47,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:00:47" (1/1) ... [2022-04-27 19:00:47,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:00:47" (1/1) ... [2022-04-27 19:00:47,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:00:47" (1/1) ... [2022-04-27 19:00:47,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:00:47" (1/1) ... [2022-04-27 19:00:47,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:00:47" (1/1) ... [2022-04-27 19:00:47,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 19:00:47,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 19:00:47,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 19:00:47,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 19:00:47,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:00:47" (1/1) ... [2022-04-27 19:00:47,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 19:00:47,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:00:47,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 19:00:47,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 19:00:47,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 19:00:47,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 19:00:47,137 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 19:00:47,137 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 19:00:47,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 19:00:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 19:00:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 19:00:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 19:00:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 19:00:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 19:00:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 19:00:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 19:00:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 19:00:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 19:00:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 19:00:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 19:00:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 19:00:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 19:00:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 19:00:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 19:00:47,188 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 19:00:47,189 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 19:00:47,370 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 19:00:47,374 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 19:00:47,374 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 19:00:47,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:00:47 BoogieIcfgContainer [2022-04-27 19:00:47,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 19:00:47,376 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 19:00:47,376 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 19:00:47,378 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 19:00:47,380 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:00:47" (1/1) ... [2022-04-27 19:00:47,381 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 19:00:47,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 07:00:47 BasicIcfg [2022-04-27 19:00:47,396 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 19:00:47,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 19:00:47,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 19:00:47,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 19:00:47,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 07:00:46" (1/4) ... [2022-04-27 19:00:47,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c7958f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 07:00:47, skipping insertion in model container [2022-04-27 19:00:47,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:00:47" (2/4) ... [2022-04-27 19:00:47,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c7958f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 07:00:47, skipping insertion in model container [2022-04-27 19:00:47,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:00:47" (3/4) ... [2022-04-27 19:00:47,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c7958f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 07:00:47, skipping insertion in model container [2022-04-27 19:00:47,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 07:00:47" (4/4) ... [2022-04-27 19:00:47,402 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound100.cJordan [2022-04-27 19:00:47,411 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 19:00:47,411 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 19:00:47,436 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 19:00:47,442 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4380bd5d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@28d9d4ba [2022-04-27 19:00:47,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 19:00:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 19:00:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 19:00:47,454 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:00:47,454 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:00:47,455 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:00:47,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:00:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1011787902, now seen corresponding path program 1 times [2022-04-27 19:00:47,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:00:47,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500934043] [2022-04-27 19:00:47,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:00:47,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:00:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:47,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 19:00:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:47,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {41#true} is VALID [2022-04-27 19:00:47,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 19:00:47,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 19:00:47,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 19:00:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:47,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 19:00:47,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 19:00:47,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 19:00:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:47,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 19:00:47,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 19:00:47,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 19:00:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:47,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 19:00:47,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 19:00:47,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 19:00:47,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {41#true} is VALID [2022-04-27 19:00:47,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 19:00:47,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 19:00:47,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 19:00:47,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {41#true} is VALID [2022-04-27 19:00:47,673 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-27 19:00:47,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 19:00:47,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 19:00:47,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {42#false} is VALID [2022-04-27 19:00:47,675 INFO L272 TraceCheckUtils]: 12: Hoare triple {42#false} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-27 19:00:47,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 19:00:47,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,677 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42#false} {42#false} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 19:00:47,677 INFO L272 TraceCheckUtils]: 17: Hoare triple {42#false} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-27 19:00:47,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {41#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 19:00:47,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,678 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42#false} {42#false} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 19:00:47,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {42#false} is VALID [2022-04-27 19:00:47,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#false} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,680 INFO L272 TraceCheckUtils]: 24: Hoare triple {42#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {42#false} is VALID [2022-04-27 19:00:47,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {42#false} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {42#false} is VALID [2022-04-27 19:00:47,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {42#false} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {42#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 19:00:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 19:00:47,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:00:47,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500934043] [2022-04-27 19:00:47,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500934043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:00:47,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:00:47,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 19:00:47,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607653822] [2022-04-27 19:00:47,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:00:47,691 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 19:00:47,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:00:47,694 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 19:00:47,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:00:47,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 19:00:47,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:00:47,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 19:00:47,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 19:00:47,745 INFO L87 Difference]: Start difference. First operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 19:00:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:47,909 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 19:00:47,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 19:00:47,909 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 19:00:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:00:47,910 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 19:00:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-27 19:00:47,918 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 19:00:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-27 19:00:47,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-27 19:00:47,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:00:47,999 INFO L225 Difference]: With dead ends: 38 [2022-04-27 19:00:47,999 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 19:00:48,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 19:00:48,003 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 19:00:48,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 19:00:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 19:00:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 19:00:48,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:00:48,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:00:48,021 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:00:48,022 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:00:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:48,025 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 19:00:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 19:00:48,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:00:48,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:00:48,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 33 states. [2022-04-27 19:00:48,027 INFO L87 Difference]: Start difference. First operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 33 states. [2022-04-27 19:00:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:48,029 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 19:00:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 19:00:48,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:00:48,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:00:48,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:00:48,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:00:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:00:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-04-27 19:00:48,033 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 28 [2022-04-27 19:00:48,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:00:48,034 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-04-27 19:00:48,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 19:00:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 19:00:48,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 19:00:48,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:00:48,044 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:00:48,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 19:00:48,044 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:00:48,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:00:48,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1710049411, now seen corresponding path program 1 times [2022-04-27 19:00:48,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:00:48,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624218217] [2022-04-27 19:00:48,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:00:48,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:00:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 19:00:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:48,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {198#true} is VALID [2022-04-27 19:00:48,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {198#true} {198#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 19:00:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:48,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#true} is VALID [2022-04-27 19:00:48,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-27 19:00:48,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 19:00:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:48,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#true} is VALID [2022-04-27 19:00:48,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-27 19:00:48,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 19:00:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:48,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#true} is VALID [2022-04-27 19:00:48,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-27 19:00:48,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {198#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 19:00:48,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {198#true} is VALID [2022-04-27 19:00:48,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {198#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {198#true} is VALID [2022-04-27 19:00:48,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {198#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-27 19:00:48,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {198#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#true} is VALID [2022-04-27 19:00:48,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {198#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {198#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,157 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {198#true} {198#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-27 19:00:48,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {198#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {198#true} is VALID [2022-04-27 19:00:48,157 INFO L272 TraceCheckUtils]: 12: Hoare triple {198#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-27 19:00:48,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {198#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#true} is VALID [2022-04-27 19:00:48,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {198#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,158 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {198#true} {198#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-27 19:00:48,158 INFO L272 TraceCheckUtils]: 17: Hoare triple {198#true} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-27 19:00:48,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {198#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#true} is VALID [2022-04-27 19:00:48,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {198#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {198#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-27 19:00:48,159 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {198#true} {198#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-27 19:00:48,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {198#true} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {215#(= main_~q~0 0)} is VALID [2022-04-27 19:00:48,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {215#(= main_~q~0 0)} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(= main_~q~0 0)} is VALID [2022-04-27 19:00:48,160 INFO L272 TraceCheckUtils]: 24: Hoare triple {215#(= main_~q~0 0)} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:00:48,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {216#(not (= |__VERIFIER_assert_#in~cond| 0))} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {217#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 19:00:48,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {217#(not (= __VERIFIER_assert_~cond 0))} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {199#false} is VALID [2022-04-27 19:00:48,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {199#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#false} is VALID [2022-04-27 19:00:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 19:00:48,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:00:48,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624218217] [2022-04-27 19:00:48,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624218217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:00:48,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:00:48,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 19:00:48,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838645962] [2022-04-27 19:00:48,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:00:48,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 19:00:48,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:00:48,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 19:00:48,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:00:48,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 19:00:48,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:00:48,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 19:00:48,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 19:00:48,178 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 19:00:48,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:48,657 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 19:00:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 19:00:48,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 19:00:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:00:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 19:00:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-27 19:00:48,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 19:00:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-27 19:00:48,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-27 19:00:48,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:00:48,724 INFO L225 Difference]: With dead ends: 44 [2022-04-27 19:00:48,724 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 19:00:48,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 19:00:48,725 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 19:00:48,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 19:00:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 19:00:48,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-04-27 19:00:48,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:00:48,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:00:48,735 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:00:48,736 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:00:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:48,738 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 19:00:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 19:00:48,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:00:48,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:00:48,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 44 states. [2022-04-27 19:00:48,740 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 44 states. [2022-04-27 19:00:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:48,742 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 19:00:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 19:00:48,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:00:48,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:00:48,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:00:48,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:00:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:00:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-04-27 19:00:48,756 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2022-04-27 19:00:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:00:48,756 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-04-27 19:00:48,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 19:00:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-27 19:00:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 19:00:48,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:00:48,758 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:00:48,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 19:00:48,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:00:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:00:48,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1042498848, now seen corresponding path program 1 times [2022-04-27 19:00:48,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:00:48,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802704289] [2022-04-27 19:00:48,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:00:48,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:00:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:48,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 19:00:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:48,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {398#true} is VALID [2022-04-27 19:00:48,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {398#true} {398#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 19:00:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:48,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {398#true} is VALID [2022-04-27 19:00:48,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-27 19:00:48,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 19:00:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:48,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {398#true} is VALID [2022-04-27 19:00:48,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-27 19:00:48,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 19:00:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:48,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {398#true} is VALID [2022-04-27 19:00:48,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-27 19:00:48,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 19:00:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:48,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {398#true} is VALID [2022-04-27 19:00:48,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {415#(= main_~A~0 main_~r~0)} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {415#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 19:00:48,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {398#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 19:00:48,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {398#true} is VALID [2022-04-27 19:00:48,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {398#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {398#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {398#true} is VALID [2022-04-27 19:00:48,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {398#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-27 19:00:48,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {398#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {398#true} is VALID [2022-04-27 19:00:48,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {398#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {398#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {398#true} {398#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-27 19:00:48,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {398#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {398#true} is VALID [2022-04-27 19:00:48,895 INFO L272 TraceCheckUtils]: 12: Hoare triple {398#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-27 19:00:48,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {398#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {398#true} is VALID [2022-04-27 19:00:48,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {398#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {398#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,896 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {398#true} {398#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-27 19:00:48,896 INFO L272 TraceCheckUtils]: 17: Hoare triple {398#true} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-27 19:00:48,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {398#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {398#true} is VALID [2022-04-27 19:00:48,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {398#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {398#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,896 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {398#true} {398#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-27 19:00:48,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {398#true} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {415#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 19:00:48,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {415#(= main_~A~0 main_~r~0)} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 19:00:48,897 INFO L272 TraceCheckUtils]: 24: Hoare triple {415#(= main_~A~0 main_~r~0)} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {398#true} is VALID [2022-04-27 19:00:48,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {398#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {398#true} is VALID [2022-04-27 19:00:48,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {398#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {398#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 19:00:48,898 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {398#true} {415#(= main_~A~0 main_~r~0)} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {415#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 19:00:48,907 INFO L272 TraceCheckUtils]: 29: Hoare triple {415#(= main_~A~0 main_~r~0)} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {420#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:00:48,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {420#(not (= |__VERIFIER_assert_#in~cond| 0))} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {421#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 19:00:48,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {421#(not (= __VERIFIER_assert_~cond 0))} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {399#false} is VALID [2022-04-27 19:00:48,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {399#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {399#false} is VALID [2022-04-27 19:00:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 19:00:48,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:00:48,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802704289] [2022-04-27 19:00:48,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802704289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:00:48,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:00:48,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 19:00:48,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139966192] [2022-04-27 19:00:48,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:00:48,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 19:00:48,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:00:48,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:00:48,925 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-27 19:00:48,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 19:00:48,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:00:48,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 19:00:48,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 19:00:48,926 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:00:49,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:49,294 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-27 19:00:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 19:00:49,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 19:00:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:00:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:00:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-27 19:00:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:00:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-27 19:00:49,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-27 19:00:49,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:00:49,353 INFO L225 Difference]: With dead ends: 48 [2022-04-27 19:00:49,354 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 19:00:49,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 19:00:49,361 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 19:00:49,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 48 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 19:00:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 19:00:49,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-04-27 19:00:49,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:00:49,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:00:49,370 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:00:49,370 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:00:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:49,375 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-27 19:00:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-27 19:00:49,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:00:49,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:00:49,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-04-27 19:00:49,376 INFO L87 Difference]: Start difference. First operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-04-27 19:00:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:49,381 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-27 19:00:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-27 19:00:49,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:00:49,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:00:49,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:00:49,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:00:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:00:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-27 19:00:49,384 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 33 [2022-04-27 19:00:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:00:49,384 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-27 19:00:49,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 19:00:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-27 19:00:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 19:00:49,394 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:00:49,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:00:49,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 19:00:49,394 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:00:49,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:00:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1436069466, now seen corresponding path program 1 times [2022-04-27 19:00:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:00:49,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627096649] [2022-04-27 19:00:49,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:00:49,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:00:49,408 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:00:49,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334663819] [2022-04-27 19:00:49,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:00:49,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:00:49,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:00:49,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:00:49,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 19:00:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:49,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 19:00:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:49,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:00:49,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {618#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {618#true} is VALID [2022-04-27 19:00:49,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {618#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {618#true} {618#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {618#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {618#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {618#true} is VALID [2022-04-27 19:00:49,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {618#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {618#true} is VALID [2022-04-27 19:00:49,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {618#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {618#true} is VALID [2022-04-27 19:00:49,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {618#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {618#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {618#true} {618#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {618#true} is VALID [2022-04-27 19:00:49,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {618#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {618#true} is VALID [2022-04-27 19:00:49,668 INFO L272 TraceCheckUtils]: 12: Hoare triple {618#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {618#true} is VALID [2022-04-27 19:00:49,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {618#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {618#true} is VALID [2022-04-27 19:00:49,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {618#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {618#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,670 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {618#true} {618#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {618#true} is VALID [2022-04-27 19:00:49,670 INFO L272 TraceCheckUtils]: 17: Hoare triple {618#true} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {618#true} is VALID [2022-04-27 19:00:49,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {618#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {618#true} is VALID [2022-04-27 19:00:49,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {618#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {618#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,671 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {618#true} {618#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {618#true} is VALID [2022-04-27 19:00:49,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {618#true} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:00:49,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:00:49,672 INFO L272 TraceCheckUtils]: 24: Hoare triple {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {618#true} is VALID [2022-04-27 19:00:49,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {618#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {618#true} is VALID [2022-04-27 19:00:49,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {618#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {618#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,673 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {618#true} {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:00:49,673 INFO L272 TraceCheckUtils]: 29: Hoare triple {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {618#true} is VALID [2022-04-27 19:00:49,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {618#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {618#true} is VALID [2022-04-27 19:00:49,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {618#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {618#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-27 19:00:49,688 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {618#true} {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:00:49,689 INFO L272 TraceCheckUtils]: 34: Hoare triple {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:00:49,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {726#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:00:49,689 INFO L290 TraceCheckUtils]: 36: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {619#false} is VALID [2022-04-27 19:00:49,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {619#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#false} is VALID [2022-04-27 19:00:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 19:00:49,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 19:00:49,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:00:49,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627096649] [2022-04-27 19:00:49,690 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:00:49,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334663819] [2022-04-27 19:00:49,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334663819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:00:49,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:00:49,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 19:00:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587169298] [2022-04-27 19:00:49,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:00:49,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-27 19:00:49,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:00:49,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 19:00:49,712 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-27 19:00:49,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 19:00:49,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:00:49,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 19:00:49,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 19:00:49,713 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 19:00:51,833 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-27 19:00:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:52,059 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-27 19:00:52,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:00:52,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-27 19:00:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:00:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 19:00:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 19:00:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 19:00:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 19:00:52,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-27 19:00:52,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:00:52,124 INFO L225 Difference]: With dead ends: 56 [2022-04-27 19:00:52,124 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 19:00:52,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 19:00:52,125 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:00:52,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 142 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 19:00:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 19:00:52,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 19:00:52,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:00:52,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 19:00:52,129 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 19:00:52,129 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 19:00:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:52,131 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-27 19:00:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-27 19:00:52,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:00:52,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:00:52,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 55 states. [2022-04-27 19:00:52,132 INFO L87 Difference]: Start difference. First operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 55 states. [2022-04-27 19:00:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:52,134 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-27 19:00:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-27 19:00:52,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:00:52,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:00:52,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:00:52,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:00:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 19:00:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-27 19:00:52,137 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 38 [2022-04-27 19:00:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:00:52,137 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-27 19:00:52,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 19:00:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-27 19:00:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 19:00:52,138 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:00:52,138 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:00:52,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 19:00:52,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:00:52,356 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:00:52,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:00:52,356 INFO L85 PathProgramCache]: Analyzing trace with hash 5711864, now seen corresponding path program 1 times [2022-04-27 19:00:52,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:00:52,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110022134] [2022-04-27 19:00:52,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:00:52,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:00:52,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:00:52,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115810728] [2022-04-27 19:00:52,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:00:52,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:00:52,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:00:52,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:00:52,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 19:00:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:52,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 19:00:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:52,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:00:53,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {959#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {959#true} is VALID [2022-04-27 19:00:53,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {959#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {959#true} is VALID [2022-04-27 19:00:53,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {959#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-27 19:00:53,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {959#true} is VALID [2022-04-27 19:00:53,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {959#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {959#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {959#true} {959#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-27 19:00:53,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {959#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {959#true} is VALID [2022-04-27 19:00:53,638 INFO L272 TraceCheckUtils]: 12: Hoare triple {959#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-27 19:00:53,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {959#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1003#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 19:00:53,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {1003#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1007#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 19:00:53,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {1007#(not (= |assume_abort_if_not_#in~cond| 0))} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1007#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 19:00:53,644 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1007#(not (= |assume_abort_if_not_#in~cond| 0))} {959#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1014#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 19:00:53,644 INFO L272 TraceCheckUtils]: 17: Hoare triple {1014#(<= (mod main_~B~0 4294967296) 100)} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-27 19:00:53,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {959#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {959#true} is VALID [2022-04-27 19:00:53,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {959#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,646 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {959#true} {1014#(<= (mod main_~B~0 4294967296) 100)} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1014#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 19:00:53,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {1014#(<= (mod main_~B~0 4294967296) 100)} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1033#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 19:00:53,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {1033#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 19:00:53,647 INFO L272 TraceCheckUtils]: 24: Hoare triple {1033#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {959#true} is VALID [2022-04-27 19:00:53,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {959#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {959#true} is VALID [2022-04-27 19:00:53,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {959#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {959#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,648 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {959#true} {1033#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1033#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 19:00:53,648 INFO L272 TraceCheckUtils]: 29: Hoare triple {1033#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {959#true} is VALID [2022-04-27 19:00:53,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {959#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {959#true} is VALID [2022-04-27 19:00:53,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {959#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {959#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,649 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {959#true} {1033#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1033#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 19:00:53,649 INFO L272 TraceCheckUtils]: 34: Hoare triple {1033#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {959#true} is VALID [2022-04-27 19:00:53,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {959#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {959#true} is VALID [2022-04-27 19:00:53,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {959#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {959#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:53,650 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {959#true} {1033#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} [152] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1033#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 19:00:53,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {1033#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} [138] L39-->L54-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {1085#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 19:00:53,651 INFO L290 TraceCheckUtils]: 40: Hoare triple {1085#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100))} [124] L54-2-->L47: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1085#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 19:00:53,652 INFO L272 TraceCheckUtils]: 41: Hoare triple {1085#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100))} [127] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (+ v_main_~r~0_12 (* v_main_~q~0_9 v_main_~B~0_13)) 4294967296) (mod v_main_~A~0_11 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_13, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1092#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:00:53,652 INFO L290 TraceCheckUtils]: 42: Hoare triple {1092#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1096#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:00:53,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {1096#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {960#false} is VALID [2022-04-27 19:00:53,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {960#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {960#false} is VALID [2022-04-27 19:00:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 19:00:53,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:00:54,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {960#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {960#false} is VALID [2022-04-27 19:00:54,117 INFO L290 TraceCheckUtils]: 43: Hoare triple {1096#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {960#false} is VALID [2022-04-27 19:00:54,118 INFO L290 TraceCheckUtils]: 42: Hoare triple {1092#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1096#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:00:54,118 INFO L272 TraceCheckUtils]: 41: Hoare triple {1112#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} [127] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (+ v_main_~r~0_12 (* v_main_~q~0_9 v_main_~B~0_13)) 4294967296) (mod v_main_~A~0_11 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_13, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1092#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:00:54,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {1112#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} [124] L54-2-->L47: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1112#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-27 19:00:54,119 INFO L290 TraceCheckUtils]: 39: Hoare triple {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [138] L39-->L54-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {1112#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-27 19:00:54,119 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {959#true} {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [152] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 19:00:54,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {959#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {959#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {959#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {959#true} is VALID [2022-04-27 19:00:54,120 INFO L272 TraceCheckUtils]: 34: Hoare triple {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {959#true} is VALID [2022-04-27 19:00:54,121 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {959#true} {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 19:00:54,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {959#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,121 INFO L290 TraceCheckUtils]: 31: Hoare triple {959#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {959#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {959#true} is VALID [2022-04-27 19:00:54,121 INFO L272 TraceCheckUtils]: 29: Hoare triple {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {959#true} is VALID [2022-04-27 19:00:54,122 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {959#true} {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 19:00:54,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {959#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {959#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {959#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {959#true} is VALID [2022-04-27 19:00:54,122 INFO L272 TraceCheckUtils]: 24: Hoare triple {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {959#true} is VALID [2022-04-27 19:00:54,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 19:00:54,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {959#true} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 19:00:54,127 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {959#true} {959#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-27 19:00:54,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {959#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {959#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {959#true} is VALID [2022-04-27 19:00:54,127 INFO L272 TraceCheckUtils]: 17: Hoare triple {959#true} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-27 19:00:54,128 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {959#true} {959#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-27 19:00:54,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {959#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {959#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {959#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {959#true} is VALID [2022-04-27 19:00:54,128 INFO L272 TraceCheckUtils]: 12: Hoare triple {959#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-27 19:00:54,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {959#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {959#true} is VALID [2022-04-27 19:00:54,128 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {959#true} {959#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-27 19:00:54,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {959#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {959#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {959#true} is VALID [2022-04-27 19:00:54,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {959#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-27 19:00:54,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {959#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {959#true} is VALID [2022-04-27 19:00:54,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {959#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {959#true} is VALID [2022-04-27 19:00:54,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-27 19:00:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 19:00:54,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:00:54,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110022134] [2022-04-27 19:00:54,129 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:00:54,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115810728] [2022-04-27 19:00:54,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115810728] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 19:00:54,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:00:54,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 19:00:54,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877553702] [2022-04-27 19:00:54,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:00:54,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-27 19:00:54,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:00:54,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 19:00:54,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:00:54,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 19:00:54,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:00:54,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 19:00:54,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 19:00:54,158 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 19:00:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:54,534 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 19:00:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:00:54,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-27 19:00:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:00:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 19:00:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 19:00:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 19:00:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 19:00:54,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 19:00:54,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:00:54,592 INFO L225 Difference]: With dead ends: 66 [2022-04-27 19:00:54,592 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 19:00:54,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 19:00:54,593 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 19:00:54,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 151 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 19:00:54,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 19:00:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-27 19:00:54,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:00:54,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 19:00:54,596 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 19:00:54,597 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 19:00:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:54,599 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 19:00:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-27 19:00:54,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:00:54,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:00:54,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-27 19:00:54,600 INFO L87 Difference]: Start difference. First operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-27 19:00:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:00:54,602 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 19:00:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-27 19:00:54,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:00:54,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:00:54,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:00:54,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:00:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 19:00:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-04-27 19:00:54,604 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 45 [2022-04-27 19:00:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:00:54,604 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-04-27 19:00:54,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 19:00:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-27 19:00:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 19:00:54,605 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:00:54,605 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1] [2022-04-27 19:00:54,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 19:00:54,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:00:54,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:00:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:00:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1597443315, now seen corresponding path program 1 times [2022-04-27 19:00:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:00:54,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822353529] [2022-04-27 19:00:54,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:00:54,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:00:54,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:00:54,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925211094] [2022-04-27 19:00:54,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:00:54,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:00:54,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:00:54,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:00:54,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 19:00:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:54,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 19:00:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:00:54,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:00:56,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {1503#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1503#true} is VALID [2022-04-27 19:00:56,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {1503#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {1503#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1503#true} is VALID [2022-04-27 19:00:56,495 INFO L272 TraceCheckUtils]: 6: Hoare triple {1503#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-27 19:00:56,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {1503#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1503#true} is VALID [2022-04-27 19:00:56,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {1503#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {1503#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1503#true} {1503#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-27 19:00:56,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {1503#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {1503#true} is VALID [2022-04-27 19:00:56,496 INFO L272 TraceCheckUtils]: 12: Hoare triple {1503#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-27 19:00:56,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {1503#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 19:00:56,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {1547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 19:00:56,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {1551#(not (= |assume_abort_if_not_#in~cond| 0))} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 19:00:56,500 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1551#(not (= |assume_abort_if_not_#in~cond| 0))} {1503#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1558#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 19:00:56,500 INFO L272 TraceCheckUtils]: 17: Hoare triple {1558#(<= (mod main_~B~0 4294967296) 100)} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-27 19:00:56,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {1503#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 19:00:56,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {1547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 19:00:56,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {1551#(not (= |assume_abort_if_not_#in~cond| 0))} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 19:00:56,502 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1551#(not (= |assume_abort_if_not_#in~cond| 0))} {1558#(<= (mod main_~B~0 4294967296) 100)} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1574#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 19:00:56,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {1574#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1578#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:00:56,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {1578#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1578#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:00:56,503 INFO L272 TraceCheckUtils]: 24: Hoare triple {1578#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1503#true} is VALID [2022-04-27 19:00:56,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-27 19:00:56,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,504 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1503#true} {1578#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1578#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:00:56,504 INFO L272 TraceCheckUtils]: 29: Hoare triple {1578#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1503#true} is VALID [2022-04-27 19:00:56,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-27 19:00:56,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,506 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1503#true} {1578#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1578#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:00:56,506 INFO L272 TraceCheckUtils]: 34: Hoare triple {1578#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1503#true} is VALID [2022-04-27 19:00:56,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-27 19:00:56,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,507 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1503#true} {1578#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [152] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1578#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 19:00:56,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {1578#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] L39-->L36-2: Formula: (and (<= (mod v_main_~d~0_6 4294967296) (mod v_main_~r~0_5 4294967296)) (= v_main_~d~0_5 (* v_main_~d~0_6 2)) (= v_main_~p~0_4 (* v_main_~p~0_5 2))) InVars {main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5} OutVars{main_~d~0=v_main_~d~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1630#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 19:00:56,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {1630#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 19:00:56,509 INFO L272 TraceCheckUtils]: 41: Hoare triple {1630#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1503#true} is VALID [2022-04-27 19:00:56,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-27 19:00:56,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,510 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1503#true} {1630#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1630#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 19:00:56,510 INFO L272 TraceCheckUtils]: 46: Hoare triple {1630#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1503#true} is VALID [2022-04-27 19:00:56,510 INFO L290 TraceCheckUtils]: 47: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-27 19:00:56,510 INFO L290 TraceCheckUtils]: 48: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,510 INFO L290 TraceCheckUtils]: 49: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:56,510 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1503#true} {1630#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1630#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 19:00:56,516 INFO L272 TraceCheckUtils]: 51: Hoare triple {1630#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1667#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:00:56,516 INFO L290 TraceCheckUtils]: 52: Hoare triple {1667#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1671#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:00:56,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {1671#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1504#false} is VALID [2022-04-27 19:00:56,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {1504#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#false} is VALID [2022-04-27 19:00:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-27 19:00:56,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:00:57,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {1504#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#false} is VALID [2022-04-27 19:00:57,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {1671#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1504#false} is VALID [2022-04-27 19:00:57,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {1667#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1671#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:00:57,057 INFO L272 TraceCheckUtils]: 51: Hoare triple {1687#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1667#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:00:57,057 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1503#true} {1687#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1687#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 19:00:57,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:57,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:57,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-27 19:00:57,058 INFO L272 TraceCheckUtils]: 46: Hoare triple {1687#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1503#true} is VALID [2022-04-27 19:00:57,059 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1503#true} {1687#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1687#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 19:00:57,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:57,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:57,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-27 19:00:57,059 INFO L272 TraceCheckUtils]: 41: Hoare triple {1687#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1503#true} is VALID [2022-04-27 19:00:57,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {1687#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1687#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 19:00:59,089 WARN L290 TraceCheckUtils]: 39: Hoare triple {1724#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [139] L39-->L36-2: Formula: (and (<= (mod v_main_~d~0_6 4294967296) (mod v_main_~r~0_5 4294967296)) (= v_main_~d~0_5 (* v_main_~d~0_6 2)) (= v_main_~p~0_4 (* v_main_~p~0_5 2))) InVars {main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5} OutVars{main_~d~0=v_main_~d~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1687#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-27 19:00:59,090 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1503#true} {1724#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [152] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1724#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 19:00:59,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,090 INFO L290 TraceCheckUtils]: 36: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-27 19:00:59,090 INFO L272 TraceCheckUtils]: 34: Hoare triple {1724#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1503#true} is VALID [2022-04-27 19:00:59,091 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1503#true} {1724#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1724#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 19:00:59,091 INFO L290 TraceCheckUtils]: 32: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-27 19:00:59,091 INFO L272 TraceCheckUtils]: 29: Hoare triple {1724#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1503#true} is VALID [2022-04-27 19:00:59,092 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1503#true} {1724#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1724#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 19:00:59,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-27 19:00:59,092 INFO L272 TraceCheckUtils]: 24: Hoare triple {1724#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1503#true} is VALID [2022-04-27 19:00:59,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1724#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 19:00:59,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {1503#true} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1724#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 19:00:59,093 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1503#true} {1503#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-27 19:00:59,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {1503#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {1503#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {1503#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1503#true} is VALID [2022-04-27 19:00:59,093 INFO L272 TraceCheckUtils]: 17: Hoare triple {1503#true} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-27 19:00:59,093 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1503#true} {1503#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-27 19:00:59,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {1503#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {1503#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {1503#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1503#true} is VALID [2022-04-27 19:00:59,093 INFO L272 TraceCheckUtils]: 12: Hoare triple {1503#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-27 19:00:59,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {1503#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {1503#true} is VALID [2022-04-27 19:00:59,094 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1503#true} {1503#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-27 19:00:59,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {1503#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {1503#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {1503#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1503#true} is VALID [2022-04-27 19:00:59,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {1503#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-27 19:00:59,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {1503#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1503#true} is VALID [2022-04-27 19:00:59,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {1503#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1503#true} is VALID [2022-04-27 19:00:59,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {1503#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-27 19:00:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 19:00:59,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:00:59,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822353529] [2022-04-27 19:00:59,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:00:59,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925211094] [2022-04-27 19:00:59,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925211094] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 19:00:59,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:00:59,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-04-27 19:00:59,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969407618] [2022-04-27 19:00:59,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:00:59,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2022-04-27 19:00:59,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:00:59,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 19:00:59,633 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-27 19:00:59,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 19:00:59,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:00:59,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 19:00:59,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 19:00:59,634 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 19:01:06,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 19:01:11,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 19:01:13,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 19:01:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:01:14,551 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-27 19:01:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:01:14,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2022-04-27 19:01:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:01:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 19:01:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-27 19:01:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 19:01:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-27 19:01:14,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-04-27 19:01:16,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 19:01:16,628 INFO L225 Difference]: With dead ends: 74 [2022-04-27 19:01:16,629 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 19:01:16,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-27 19:01:16,629 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-27 19:01:16,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 131 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 7.2s Time] [2022-04-27 19:01:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 19:01:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-04-27 19:01:16,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:01:16,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 19:01:16,634 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 19:01:16,634 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 19:01:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:01:16,637 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-27 19:01:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-27 19:01:16,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:01:16,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:01:16,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 74 states. [2022-04-27 19:01:16,638 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 74 states. [2022-04-27 19:01:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:01:16,645 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-27 19:01:16,646 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-27 19:01:16,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:01:16,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:01:16,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:01:16,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:01:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 19:01:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2022-04-27 19:01:16,649 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 55 [2022-04-27 19:01:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:01:16,650 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2022-04-27 19:01:16,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 19:01:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2022-04-27 19:01:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 19:01:16,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:01:16,652 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:01:16,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 19:01:16,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:01:16,856 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:01:16,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:01:16,857 INFO L85 PathProgramCache]: Analyzing trace with hash 810354846, now seen corresponding path program 1 times [2022-04-27 19:01:16,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:01:16,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259601489] [2022-04-27 19:01:16,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:01:16,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:01:16,872 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:01:16,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625595076] [2022-04-27 19:01:16,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:01:16,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:01:16,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:01:16,873 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:01:16,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 19:01:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:01:16,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 19:01:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:01:16,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:01:18,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {2139#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {2139#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2139#true} is VALID [2022-04-27 19:01:18,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {2139#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2139#true} {2139#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {2139#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {2139#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2139#true} is VALID [2022-04-27 19:01:18,948 INFO L272 TraceCheckUtils]: 6: Hoare triple {2139#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2139#true} is VALID [2022-04-27 19:01:18,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {2139#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2139#true} is VALID [2022-04-27 19:01:18,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {2139#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {2139#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2139#true} {2139#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2139#true} is VALID [2022-04-27 19:01:18,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {2139#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {2139#true} is VALID [2022-04-27 19:01:18,949 INFO L272 TraceCheckUtils]: 12: Hoare triple {2139#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2139#true} is VALID [2022-04-27 19:01:18,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {2139#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2183#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 19:01:18,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {2183#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2187#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 19:01:18,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {2187#(not (= |assume_abort_if_not_#in~cond| 0))} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2187#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 19:01:18,954 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2187#(not (= |assume_abort_if_not_#in~cond| 0))} {2139#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2194#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 19:01:18,954 INFO L272 TraceCheckUtils]: 17: Hoare triple {2194#(<= (mod main_~B~0 4294967296) 100)} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2139#true} is VALID [2022-04-27 19:01:18,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {2139#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2139#true} is VALID [2022-04-27 19:01:18,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {2139#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {2139#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,959 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2139#true} {2194#(<= (mod main_~B~0 4294967296) 100)} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2194#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 19:01:18,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {2194#(<= (mod main_~B~0 4294967296) 100)} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {2213#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 19:01:18,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {2213#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2213#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 19:01:18,960 INFO L272 TraceCheckUtils]: 24: Hoare triple {2213#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2139#true} is VALID [2022-04-27 19:01:18,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {2139#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2139#true} is VALID [2022-04-27 19:01:18,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {2139#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {2139#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,961 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2139#true} {2213#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2213#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 19:01:18,961 INFO L272 TraceCheckUtils]: 29: Hoare triple {2213#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2139#true} is VALID [2022-04-27 19:01:18,961 INFO L290 TraceCheckUtils]: 30: Hoare triple {2139#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2139#true} is VALID [2022-04-27 19:01:18,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {2139#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {2139#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,962 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2139#true} {2213#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2213#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 19:01:18,962 INFO L272 TraceCheckUtils]: 34: Hoare triple {2213#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2139#true} is VALID [2022-04-27 19:01:18,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {2139#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2139#true} is VALID [2022-04-27 19:01:18,962 INFO L290 TraceCheckUtils]: 36: Hoare triple {2139#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {2139#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,964 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2139#true} {2213#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [152] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2213#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 19:01:18,964 INFO L290 TraceCheckUtils]: 39: Hoare triple {2213#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [138] L39-->L54-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {2265#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 19:01:18,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {2265#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [124] L54-2-->L47: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2265#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 19:01:18,965 INFO L272 TraceCheckUtils]: 41: Hoare triple {2265#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [127] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (+ v_main_~r~0_12 (* v_main_~q~0_9 v_main_~B~0_13)) 4294967296) (mod v_main_~A~0_11 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_13, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2139#true} is VALID [2022-04-27 19:01:18,965 INFO L290 TraceCheckUtils]: 42: Hoare triple {2139#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2139#true} is VALID [2022-04-27 19:01:18,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {2139#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,965 INFO L290 TraceCheckUtils]: 44: Hoare triple {2139#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,965 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2139#true} {2265#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [153] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (+ v_main_~r~0_12 (* v_main_~q~0_9 v_main_~B~0_13)) 4294967296) (mod v_main_~A~0_11 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_13, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2265#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 19:01:18,965 INFO L272 TraceCheckUtils]: 46: Hoare triple {2265#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [131] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_14) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_14, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2139#true} is VALID [2022-04-27 19:01:18,965 INFO L290 TraceCheckUtils]: 47: Hoare triple {2139#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2139#true} is VALID [2022-04-27 19:01:18,965 INFO L290 TraceCheckUtils]: 48: Hoare triple {2139#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,966 INFO L290 TraceCheckUtils]: 49: Hoare triple {2139#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:18,967 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2139#true} {2265#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [154] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_14) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_14, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2265#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 19:01:18,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {2265#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [136] L48-->L46-1: Formula: (= (mod v_main_~p~0_7 4294967296) 1) InVars {main_~p~0=v_main_~p~0_7} OutVars{main_~p~0=v_main_~p~0_7} AuxVars[] AssignedVars[] {2265#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 19:01:18,968 INFO L272 TraceCheckUtils]: 52: Hoare triple {2265#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [126] L46-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_12 4294967296) (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_12, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {2305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:01:18,968 INFO L290 TraceCheckUtils]: 53: Hoare triple {2305#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:01:18,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {2309#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2140#false} is VALID [2022-04-27 19:01:18,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {2140#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2140#false} is VALID [2022-04-27 19:01:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-27 19:01:18,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:01:19,982 INFO L290 TraceCheckUtils]: 55: Hoare triple {2140#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2140#false} is VALID [2022-04-27 19:01:19,982 INFO L290 TraceCheckUtils]: 54: Hoare triple {2309#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2140#false} is VALID [2022-04-27 19:01:19,983 INFO L290 TraceCheckUtils]: 53: Hoare triple {2305#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:01:19,983 INFO L272 TraceCheckUtils]: 52: Hoare triple {2325#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [126] L46-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_12 4294967296) (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_12, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {2305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:01:19,984 INFO L290 TraceCheckUtils]: 51: Hoare triple {2325#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [136] L48-->L46-1: Formula: (= (mod v_main_~p~0_7 4294967296) 1) InVars {main_~p~0=v_main_~p~0_7} OutVars{main_~p~0=v_main_~p~0_7} AuxVars[] AssignedVars[] {2325#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 19:01:19,984 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2139#true} {2325#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [154] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_14) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_14, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2325#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 19:01:19,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {2139#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,984 INFO L290 TraceCheckUtils]: 48: Hoare triple {2139#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {2139#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2139#true} is VALID [2022-04-27 19:01:19,985 INFO L272 TraceCheckUtils]: 46: Hoare triple {2325#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [131] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_14) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_14, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2139#true} is VALID [2022-04-27 19:01:19,985 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2139#true} {2325#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [153] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (+ v_main_~r~0_12 (* v_main_~q~0_9 v_main_~B~0_13)) 4294967296) (mod v_main_~A~0_11 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_13, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2325#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 19:01:19,985 INFO L290 TraceCheckUtils]: 44: Hoare triple {2139#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {2139#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {2139#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2139#true} is VALID [2022-04-27 19:01:19,985 INFO L272 TraceCheckUtils]: 41: Hoare triple {2325#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [127] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (+ v_main_~r~0_12 (* v_main_~q~0_9 v_main_~B~0_13)) 4294967296) (mod v_main_~A~0_11 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_13, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2139#true} is VALID [2022-04-27 19:01:19,986 INFO L290 TraceCheckUtils]: 40: Hoare triple {2325#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [124] L54-2-->L47: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2325#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 19:01:19,986 INFO L290 TraceCheckUtils]: 39: Hoare triple {2365#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [138] L39-->L54-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {2325#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 19:01:19,987 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2139#true} {2365#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [152] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2365#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 19:01:19,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {2139#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {2139#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {2139#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2139#true} is VALID [2022-04-27 19:01:19,987 INFO L272 TraceCheckUtils]: 34: Hoare triple {2365#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2139#true} is VALID [2022-04-27 19:01:19,988 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2139#true} {2365#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2365#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 19:01:19,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {2139#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {2139#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {2139#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2139#true} is VALID [2022-04-27 19:01:19,988 INFO L272 TraceCheckUtils]: 29: Hoare triple {2365#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2139#true} is VALID [2022-04-27 19:01:19,988 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2139#true} {2365#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2365#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 19:01:19,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {2139#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {2139#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {2139#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2139#true} is VALID [2022-04-27 19:01:19,989 INFO L272 TraceCheckUtils]: 24: Hoare triple {2365#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2139#true} is VALID [2022-04-27 19:01:19,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {2365#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2365#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 19:01:19,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {2139#true} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {2365#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 19:01:19,989 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2139#true} {2139#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {2139#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {2139#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {2139#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L272 TraceCheckUtils]: 17: Hoare triple {2139#true} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2139#true} {2139#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {2139#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {2139#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {2139#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L272 TraceCheckUtils]: 12: Hoare triple {2139#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {2139#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2139#true} {2139#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {2139#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {2139#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {2139#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2139#true} is VALID [2022-04-27 19:01:19,990 INFO L272 TraceCheckUtils]: 6: Hoare triple {2139#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2139#true} is VALID [2022-04-27 19:01:19,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {2139#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2139#true} is VALID [2022-04-27 19:01:19,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {2139#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2139#true} {2139#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {2139#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {2139#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2139#true} is VALID [2022-04-27 19:01:19,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {2139#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#true} is VALID [2022-04-27 19:01:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 19:01:19,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:01:19,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259601489] [2022-04-27 19:01:19,991 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:01:19,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625595076] [2022-04-27 19:01:19,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625595076] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 19:01:19,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:01:19,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 19:01:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198691427] [2022-04-27 19:01:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:01:19,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-27 19:01:19,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:01:19,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 19:01:20,028 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-27 19:01:20,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 19:01:20,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:01:20,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 19:01:20,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 19:01:20,029 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 19:01:28,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 19:01:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:01:29,719 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-04-27 19:01:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:01:29,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-27 19:01:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:01:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 19:01:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 19:01:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 19:01:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 19:01:29,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 19:01:29,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:01:29,777 INFO L225 Difference]: With dead ends: 75 [2022-04-27 19:01:29,777 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 19:01:29,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 19:01:29,778 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-27 19:01:29,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 177 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-27 19:01:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 19:01:29,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-27 19:01:29,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:01:29,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 19:01:29,782 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 19:01:29,782 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 19:01:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:01:29,784 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-04-27 19:01:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-27 19:01:29,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:01:29,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:01:29,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 70 states. [2022-04-27 19:01:29,785 INFO L87 Difference]: Start difference. First operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 70 states. [2022-04-27 19:01:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:01:29,787 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-04-27 19:01:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-27 19:01:29,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:01:29,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:01:29,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:01:29,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:01:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 19:01:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-27 19:01:29,789 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 56 [2022-04-27 19:01:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:01:29,789 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-27 19:01:29,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 19:01:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-27 19:01:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 19:01:29,790 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:01:29,790 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:01:29,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 19:01:30,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:01:30,006 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:01:30,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:01:30,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1535015126, now seen corresponding path program 1 times [2022-04-27 19:01:30,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:01:30,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770907083] [2022-04-27 19:01:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:01:30,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:01:30,016 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:01:30,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001558933] [2022-04-27 19:01:30,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:01:30,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:01:30,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:01:30,017 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:01:30,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process