/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/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 01:25:42,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 01:25:42,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 01:25:42,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 01:25:42,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 01:25:42,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 01:25:42,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 01:25:42,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 01:25:42,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 01:25:42,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 01:25:42,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 01:25:42,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 01:25:42,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 01:25:42,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 01:25:42,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 01:25:42,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 01:25:42,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 01:25:42,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 01:25:42,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 01:25:42,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 01:25:42,136 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 01:25:42,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 01:25:42,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 01:25:42,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 01:25:42,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 01:25:42,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 01:25:42,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 01:25:42,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 01:25:42,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 01:25:42,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 01:25:42,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 01:25:42,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 01:25:42,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 01:25:42,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 01:25:42,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 01:25:42,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 01:25:42,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 01:25:42,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 01:25:42,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 01:25:42,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 01:25:42,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 01:25:42,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 01:25:42,151 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 01:25:42,183 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 01:25:42,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 01:25:42,184 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 01:25:42,184 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 01:25:42,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 01:25:42,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 01:25:42,185 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 01:25:42,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 01:25:42,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 01:25:42,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 01:25:42,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 01:25:42,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 01:25:42,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 01:25:42,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 01:25:42,186 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 01:25:42,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 01:25:42,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 01:25:42,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 01:25:42,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 01:25:42,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 01:25:42,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 01:25:42,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 01:25:42,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 01:25:42,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 01:25:42,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 01:25:42,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 01:25:42,193 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 01:25:42,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 01:25:42,194 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 01:25:42,194 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-08 01:25:42,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 01:25:42,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 01:25:42,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 01:25:42,411 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 01:25:42,412 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 01:25:42,414 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound5.c [2022-04-08 01:25:42,468 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993627582/3637f04793a84ef39668fd439b032355/FLAGa7ef6eb8b [2022-04-08 01:25:42,813 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 01:25:42,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound5.c [2022-04-08 01:25:42,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993627582/3637f04793a84ef39668fd439b032355/FLAGa7ef6eb8b [2022-04-08 01:25:43,218 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993627582/3637f04793a84ef39668fd439b032355 [2022-04-08 01:25:43,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 01:25:43,222 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 01:25:43,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 01:25:43,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 01:25:43,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 01:25:43,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:25:43" (1/1) ... [2022-04-08 01:25:43,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e811f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:25:43, skipping insertion in model container [2022-04-08 01:25:43,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:25:43" (1/1) ... [2022-04-08 01:25:43,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 01:25:43,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 01:25:43,387 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_valuebound5.c[537,550] [2022-04-08 01:25:43,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 01:25:43,419 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 01:25:43,429 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_valuebound5.c[537,550] [2022-04-08 01:25:43,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 01:25:43,449 INFO L208 MainTranslator]: Completed translation [2022-04-08 01:25:43,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:25:43 WrapperNode [2022-04-08 01:25:43,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 01:25:43,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 01:25:43,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 01:25:43,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 01:25:43,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:25:43" (1/1) ... [2022-04-08 01:25:43,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:25:43" (1/1) ... [2022-04-08 01:25:43,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:25:43" (1/1) ... [2022-04-08 01:25:43,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:25:43" (1/1) ... [2022-04-08 01:25:43,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:25:43" (1/1) ... [2022-04-08 01:25:43,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:25:43" (1/1) ... [2022-04-08 01:25:43,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:25:43" (1/1) ... [2022-04-08 01:25:43,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 01:25:43,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 01:25:43,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 01:25:43,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 01:25:43,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:25:43" (1/1) ... [2022-04-08 01:25:43,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 01:25:43,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:25:43,529 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-08 01:25:43,543 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-08 01:25:43,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 01:25:43,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 01:25:43,567 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 01:25:43,567 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 01:25:43,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 01:25:43,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 01:25:43,567 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 01:25:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 01:25:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 01:25:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 01:25:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 01:25:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 01:25:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 01:25:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 01:25:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 01:25:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 01:25:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 01:25:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 01:25:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 01:25:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 01:25:43,626 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 01:25:43,628 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 01:25:43,820 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 01:25:43,829 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 01:25:43,829 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 01:25:43,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:25:43 BoogieIcfgContainer [2022-04-08 01:25:43,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 01:25:43,831 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 01:25:43,831 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 01:25:43,832 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 01:25:43,834 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:25:43" (1/1) ... [2022-04-08 01:25:43,835 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 01:25:43,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:25:43 BasicIcfg [2022-04-08 01:25:43,867 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 01:25:43,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 01:25:43,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 01:25:43,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 01:25:43,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 01:25:43" (1/4) ... [2022-04-08 01:25:43,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515cd329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:25:43, skipping insertion in model container [2022-04-08 01:25:43,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:25:43" (2/4) ... [2022-04-08 01:25:43,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515cd329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:25:43, skipping insertion in model container [2022-04-08 01:25:43,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:25:43" (3/4) ... [2022-04-08 01:25:43,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515cd329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 01:25:43, skipping insertion in model container [2022-04-08 01:25:43,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:25:43" (4/4) ... [2022-04-08 01:25:43,874 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound5.cqvasr [2022-04-08 01:25:43,879 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 01:25:43,879 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 01:25:43,915 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 01:25:43,921 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 01:25:43,922 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 01:25:43,942 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-08 01:25:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 01:25:43,946 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:25:43,947 INFO L499 BasicCegarLoop]: 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-08 01:25:43,947 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:25:43,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:25:43,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1011787902, now seen corresponding path program 1 times [2022-04-08 01:25:43,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:25:43,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769695054] [2022-04-08 01:25:43,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:25:43,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:25:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:44,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 01:25:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:44,193 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-08 01:25:44,194 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-08 01:25:44,194 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-08 01:25:44,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 01:25:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:44,213 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-08 01:25:44,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-08 01:25:44,215 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-08 01:25:44,215 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) 5) 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-08 01:25:44,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 01:25:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:44,239 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-08 01:25:44,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-08 01:25:44,240 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-08 01:25:44,241 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) 5) 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-08 01:25:44,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 01:25:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:44,258 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-08 01:25:44,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-08 01:25:44,259 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-08 01:25:44,260 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-08 01:25:44,261 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-08 01:25:44,261 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-08 01:25:44,261 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-08 01:25:44,261 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-08 01:25:44,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-08 01:25:44,262 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-08 01:25:44,262 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 5) 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-08 01:25:44,262 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-08 01:25:44,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-08 01:25:44,263 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-08 01:25:44,263 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) 5) 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-08 01:25:44,263 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-08 01:25:44,264 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) 5) 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-08 01:25:44,264 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-08 01:25:44,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-08 01:25:44,266 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-08 01:25:44,266 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) 5) 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-08 01:25:44,267 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-08 01:25:44,267 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-08 01:25:44,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-08 01:25:44,268 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-08 01:25:44,268 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-08 01:25:44,268 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-08 01:25:44,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#false} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-08 01:25:44,269 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-08 01:25:44,269 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-08 01:25:44,269 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-08 01:25:44,270 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-08 01:25:44,270 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-08 01:25:44,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:25:44,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769695054] [2022-04-08 01:25:44,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769695054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:25:44,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:25:44,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 01:25:44,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528989799] [2022-04-08 01:25:44,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:25:44,278 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-08 01:25:44,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:25:44,282 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-08 01:25:44,312 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-08 01:25:44,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 01:25:44,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:25:44,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 01:25:44,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 01:25:44,349 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-08 01:25:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:44,560 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2022-04-08 01:25:44,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 01:25:44,562 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-08 01:25:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:25:44,565 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-08 01:25:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-08 01:25:44,585 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-08 01:25:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-08 01:25:44,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-04-08 01:25:44,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:25:44,735 INFO L225 Difference]: With dead ends: 69 [2022-04-08 01:25:44,735 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 01:25:44,738 INFO L912 BasicCegarLoop]: 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-08 01:25:44,742 INFO L913 BasicCegarLoop]: 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-08 01:25:44,743 INFO L914 BasicCegarLoop]: 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-08 01:25:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 01:25:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 01:25:44,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:25:44,770 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-08 01:25:44,770 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-08 01:25:44,771 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-08 01:25:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:44,775 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-08 01:25:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-08 01:25:44,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:25:44,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:25:44,777 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-08 01:25:44,777 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-08 01:25:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:44,781 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-08 01:25:44,782 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-08 01:25:44,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:25:44,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:25:44,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:25:44,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:25:44,783 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-08 01:25:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-04-08 01:25:44,787 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 28 [2022-04-08 01:25:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:25:44,788 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-04-08 01:25:44,788 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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-08 01:25:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-08 01:25:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 01:25:44,789 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:25:44,789 INFO L499 BasicCegarLoop]: 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-08 01:25:44,789 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 01:25:44,790 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:25:44,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:25:44,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1710049411, now seen corresponding path program 1 times [2022-04-08 01:25:44,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:25:44,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711040045] [2022-04-08 01:25:44,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:25:44,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:25:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:44,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 01:25:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:44,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#(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] {275#true} is VALID [2022-04-08 01:25:44,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-08 01:25:44,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {275#true} {275#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-08 01:25:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 01:25:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:44,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#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] {275#true} is VALID [2022-04-08 01:25:44,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#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[] {275#true} is VALID [2022-04-08 01:25:44,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-08 01:25:44,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#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) 5) 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] {275#true} is VALID [2022-04-08 01:25:44,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 01:25:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:44,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#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] {275#true} is VALID [2022-04-08 01:25:44,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#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[] {275#true} is VALID [2022-04-08 01:25:44,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-08 01:25:44,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#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) 5) 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] {275#true} is VALID [2022-04-08 01:25:44,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 01:25:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:44,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#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] {275#true} is VALID [2022-04-08 01:25:44,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#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[] {275#true} is VALID [2022-04-08 01:25:44,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-08 01:25:44,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#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] {275#true} is VALID [2022-04-08 01:25:44,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {275#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 01:25:44,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#(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] {275#true} is VALID [2022-04-08 01:25:44,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-08 01:25:44,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-08 01:25:44,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {275#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-08 01:25:44,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {275#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] {275#true} is VALID [2022-04-08 01:25:44,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {275#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 5) 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] {275#true} is VALID [2022-04-08 01:25:44,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#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] {275#true} is VALID [2022-04-08 01:25:44,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#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[] {275#true} is VALID [2022-04-08 01:25:44,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {275#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-08 01:25:44,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {275#true} {275#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) 5) 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] {275#true} is VALID [2022-04-08 01:25:44,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {275#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] {275#true} is VALID [2022-04-08 01:25:44,913 INFO L272 TraceCheckUtils]: 12: Hoare triple {275#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 5) 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] {275#true} is VALID [2022-04-08 01:25:44,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {275#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] {275#true} is VALID [2022-04-08 01:25:44,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#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[] {275#true} is VALID [2022-04-08 01:25:44,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-08 01:25:44,914 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {275#true} {275#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) 5) 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] {275#true} is VALID [2022-04-08 01:25:44,914 INFO L272 TraceCheckUtils]: 17: Hoare triple {275#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] {275#true} is VALID [2022-04-08 01:25:44,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#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] {275#true} is VALID [2022-04-08 01:25:44,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#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[] {275#true} is VALID [2022-04-08 01:25:44,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {275#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-08 01:25:44,915 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {275#true} {275#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] {275#true} is VALID [2022-04-08 01:25:44,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {275#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] {292#(= main_~q~0 0)} is VALID [2022-04-08 01:25:44,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {292#(= main_~q~0 0)} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(= main_~q~0 0)} is VALID [2022-04-08 01:25:44,917 INFO L272 TraceCheckUtils]: 24: Hoare triple {292#(= 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] {293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:25:44,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {293#(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] {294#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 01:25:44,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {294#(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[] {276#false} is VALID [2022-04-08 01:25:44,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {276#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#false} is VALID [2022-04-08 01:25:44,918 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-08 01:25:44,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:25:44,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711040045] [2022-04-08 01:25:44,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711040045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:25:44,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:25:44,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 01:25:44,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033058006] [2022-04-08 01:25:44,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:25:44,920 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-08 01:25:44,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:25:44,921 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-08 01:25:44,940 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-08 01:25:44,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 01:25:44,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:25:44,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 01:25:44,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 01:25:44,942 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-08 01:25:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:45,432 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-08 01:25:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 01:25:45,432 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-08 01:25:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:25:45,433 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-08 01:25:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 01:25:45,436 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-08 01:25:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 01:25:45,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-08 01:25:45,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:25:45,510 INFO L225 Difference]: With dead ends: 46 [2022-04-08 01:25:45,511 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 01:25:45,511 INFO L912 BasicCegarLoop]: 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-08 01:25:45,512 INFO L913 BasicCegarLoop]: 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-08 01:25:45,513 INFO L914 BasicCegarLoop]: 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-08 01:25:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 01:25:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-04-08 01:25:45,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:25:45,520 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-08 01:25:45,521 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-08 01:25:45,521 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-08 01:25:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:45,524 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 01:25:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 01:25:45,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:25:45,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:25:45,526 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-08 01:25:45,526 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-08 01:25:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:45,529 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 01:25:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 01:25:45,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:25:45,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:25:45,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:25:45,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:25:45,531 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-08 01:25:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-04-08 01:25:45,533 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2022-04-08 01:25:45,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:25:45,533 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-04-08 01:25:45,534 INFO L479 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-08 01:25:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-08 01:25:45,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 01:25:45,535 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:25:45,535 INFO L499 BasicCegarLoop]: 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-08 01:25:45,535 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 01:25:45,535 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:25:45,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:25:45,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1042498848, now seen corresponding path program 1 times [2022-04-08 01:25:45,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:25:45,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569324847] [2022-04-08 01:25:45,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:25:45,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:25:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 01:25:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:45,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {541#(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] {517#true} is VALID [2022-04-08 01:25:45,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {517#true} is VALID [2022-04-08 01:25:45,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {517#true} {517#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {517#true} is VALID [2022-04-08 01:25:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 01:25:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:45,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#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] {517#true} is VALID [2022-04-08 01:25:45,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#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[] {517#true} is VALID [2022-04-08 01:25:45,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {517#true} is VALID [2022-04-08 01:25:45,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#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) 5) 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] {517#true} is VALID [2022-04-08 01:25:45,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 01:25:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:45,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#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] {517#true} is VALID [2022-04-08 01:25:45,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#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[] {517#true} is VALID [2022-04-08 01:25:45,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {517#true} is VALID [2022-04-08 01:25:45,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#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) 5) 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] {517#true} is VALID [2022-04-08 01:25:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 01:25:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:45,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#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] {517#true} is VALID [2022-04-08 01:25:45,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#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[] {517#true} is VALID [2022-04-08 01:25:45,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {517#true} is VALID [2022-04-08 01:25:45,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#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] {517#true} is VALID [2022-04-08 01:25:45,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 01:25:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:45,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#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] {517#true} is VALID [2022-04-08 01:25:45,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#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[] {517#true} is VALID [2022-04-08 01:25:45,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {517#true} is VALID [2022-04-08 01:25:45,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {534#(= 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] {534#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 01:25:45,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {517#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 01:25:45,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {541#(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] {517#true} is VALID [2022-04-08 01:25:45,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {517#true} is VALID [2022-04-08 01:25:45,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {517#true} is VALID [2022-04-08 01:25:45,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {517#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {517#true} is VALID [2022-04-08 01:25:45,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {517#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] {517#true} is VALID [2022-04-08 01:25:45,703 INFO L272 TraceCheckUtils]: 6: Hoare triple {517#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 5) 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] {517#true} is VALID [2022-04-08 01:25:45,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {517#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] {517#true} is VALID [2022-04-08 01:25:45,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {517#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[] {517#true} is VALID [2022-04-08 01:25:45,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {517#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {517#true} is VALID [2022-04-08 01:25:45,704 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {517#true} {517#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) 5) 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] {517#true} is VALID [2022-04-08 01:25:45,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {517#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] {517#true} is VALID [2022-04-08 01:25:45,704 INFO L272 TraceCheckUtils]: 12: Hoare triple {517#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 5) 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] {517#true} is VALID [2022-04-08 01:25:45,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {517#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] {517#true} is VALID [2022-04-08 01:25:45,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {517#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[] {517#true} is VALID [2022-04-08 01:25:45,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {517#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {517#true} is VALID [2022-04-08 01:25:45,705 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {517#true} {517#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) 5) 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] {517#true} is VALID [2022-04-08 01:25:45,705 INFO L272 TraceCheckUtils]: 17: Hoare triple {517#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] {517#true} is VALID [2022-04-08 01:25:45,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {517#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] {517#true} is VALID [2022-04-08 01:25:45,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {517#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[] {517#true} is VALID [2022-04-08 01:25:45,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {517#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {517#true} is VALID [2022-04-08 01:25:45,706 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {517#true} {517#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] {517#true} is VALID [2022-04-08 01:25:45,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {517#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] {534#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 01:25:45,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {534#(= main_~A~0 main_~r~0)} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {534#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 01:25:45,707 INFO L272 TraceCheckUtils]: 24: Hoare triple {534#(= 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] {517#true} is VALID [2022-04-08 01:25:45,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {517#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] {517#true} is VALID [2022-04-08 01:25:45,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {517#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[] {517#true} is VALID [2022-04-08 01:25:45,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {517#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {517#true} is VALID [2022-04-08 01:25:45,708 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {517#true} {534#(= 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] {534#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 01:25:45,709 INFO L272 TraceCheckUtils]: 29: Hoare triple {534#(= 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] {539#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:25:45,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {539#(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] {540#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 01:25:45,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {540#(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[] {518#false} is VALID [2022-04-08 01:25:45,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {518#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {518#false} is VALID [2022-04-08 01:25:45,711 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-08 01:25:45,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:25:45,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569324847] [2022-04-08 01:25:45,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569324847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:25:45,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:25:45,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 01:25:45,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182685550] [2022-04-08 01:25:45,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:25:45,712 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-08 01:25:45,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:25:45,713 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-08 01:25:45,734 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-08 01:25:45,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 01:25:45,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:25:45,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 01:25:45,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 01:25:45,736 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-08 01:25:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:46,168 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-08 01:25:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 01:25:46,169 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-08 01:25:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:25:46,169 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-08 01:25:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 01:25:46,172 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-08 01:25:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 01:25:46,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-08 01:25:46,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:25:46,242 INFO L225 Difference]: With dead ends: 50 [2022-04-08 01:25:46,242 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 01:25:46,242 INFO L912 BasicCegarLoop]: 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-08 01:25:46,243 INFO L913 BasicCegarLoop]: 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-08 01:25:46,244 INFO L914 BasicCegarLoop]: 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-08 01:25:46,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 01:25:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-04-08 01:25:46,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:25:46,250 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-08 01:25:46,251 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-08 01:25:46,251 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-08 01:25:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:46,254 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-08 01:25:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-08 01:25:46,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:25:46,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:25:46,255 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-08 01:25:46,256 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-08 01:25:46,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:46,258 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-08 01:25:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-08 01:25:46,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:25:46,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:25:46,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:25:46,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:25:46,260 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-08 01:25:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-08 01:25:46,262 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 33 [2022-04-08 01:25:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:25:46,262 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-08 01:25:46,262 INFO L479 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-08 01:25:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-08 01:25:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 01:25:46,263 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:25:46,264 INFO L499 BasicCegarLoop]: 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-08 01:25:46,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 01:25:46,264 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:25:46,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:25:46,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1436069466, now seen corresponding path program 1 times [2022-04-08 01:25:46,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:25:46,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048796943] [2022-04-08 01:25:46,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:25:46,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:25:46,286 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:25:46,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93145722] [2022-04-08 01:25:46,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:25:46,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:25:46,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:25:46,288 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-08 01:25:46,298 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-08 01:25:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:46,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 01:25:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:46,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:25:46,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#true} is VALID [2022-04-08 01:25:46,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#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] {781#true} is VALID [2022-04-08 01:25:46,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#true} is VALID [2022-04-08 01:25:46,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#true} is VALID [2022-04-08 01:25:46,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#true} is VALID [2022-04-08 01:25:46,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#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] {781#true} is VALID [2022-04-08 01:25:46,629 INFO L272 TraceCheckUtils]: 6: Hoare triple {781#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 5) 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] {781#true} is VALID [2022-04-08 01:25:46,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#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] {781#true} is VALID [2022-04-08 01:25:46,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {781#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[] {781#true} is VALID [2022-04-08 01:25:46,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#true} is VALID [2022-04-08 01:25:46,630 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {781#true} {781#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) 5) 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] {781#true} is VALID [2022-04-08 01:25:46,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {781#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] {781#true} is VALID [2022-04-08 01:25:46,630 INFO L272 TraceCheckUtils]: 12: Hoare triple {781#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 5) 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] {781#true} is VALID [2022-04-08 01:25:46,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {781#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] {781#true} is VALID [2022-04-08 01:25:46,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {781#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[] {781#true} is VALID [2022-04-08 01:25:46,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {781#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#true} is VALID [2022-04-08 01:25:46,631 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {781#true} {781#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) 5) 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] {781#true} is VALID [2022-04-08 01:25:46,631 INFO L272 TraceCheckUtils]: 17: Hoare triple {781#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] {781#true} is VALID [2022-04-08 01:25:46,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {781#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] {781#true} is VALID [2022-04-08 01:25:46,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {781#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[] {781#true} is VALID [2022-04-08 01:25:46,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {781#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#true} is VALID [2022-04-08 01:25:46,632 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {781#true} {781#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] {781#true} is VALID [2022-04-08 01:25:46,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#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] {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:25:46,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:25:46,637 INFO L272 TraceCheckUtils]: 24: Hoare triple {852#(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] {781#true} is VALID [2022-04-08 01:25:46,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {781#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] {781#true} is VALID [2022-04-08 01:25:46,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {781#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[] {781#true} is VALID [2022-04-08 01:25:46,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {781#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#true} is VALID [2022-04-08 01:25:46,641 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {781#true} {852#(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] {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:25:46,641 INFO L272 TraceCheckUtils]: 29: Hoare triple {852#(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] {781#true} is VALID [2022-04-08 01:25:46,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {781#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] {781#true} is VALID [2022-04-08 01:25:46,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {781#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[] {781#true} is VALID [2022-04-08 01:25:46,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {781#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#true} is VALID [2022-04-08 01:25:46,642 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {781#true} {852#(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] {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:25:46,643 INFO L272 TraceCheckUtils]: 34: Hoare triple {852#(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] {889#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:25:46,643 INFO L290 TraceCheckUtils]: 35: Hoare triple {889#(<= 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] {893#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:25:46,656 INFO L290 TraceCheckUtils]: 36: Hoare triple {893#(<= 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[] {782#false} is VALID [2022-04-08 01:25:46,657 INFO L290 TraceCheckUtils]: 37: Hoare triple {782#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {782#false} is VALID [2022-04-08 01:25:46,657 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-08 01:25:46,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 01:25:46,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:25:46,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048796943] [2022-04-08 01:25:46,658 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:25:46,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93145722] [2022-04-08 01:25:46,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93145722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:25:46,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:25:46,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 01:25:46,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293146407] [2022-04-08 01:25:46,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:25:46,659 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-08 01:25:46,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:25:46,660 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-08 01:25:46,684 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-08 01:25:46,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 01:25:46,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:25:46,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 01:25:46,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 01:25:46,685 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-08 01:25:48,856 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-08 01:25:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:49,145 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2022-04-08 01:25:49,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 01:25:49,145 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-08 01:25:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:25:49,146 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-08 01:25:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 01:25:49,148 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-08 01:25:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 01:25:49,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 01:25:49,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:25:49,228 INFO L225 Difference]: With dead ends: 58 [2022-04-08 01:25:49,229 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 01:25:49,229 INFO L912 BasicCegarLoop]: 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-08 01:25:49,230 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 01:25:49,230 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 142 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 01:25:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 01:25:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-08 01:25:49,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:25:49,248 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-08 01:25:49,249 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-08 01:25:49,250 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-08 01:25:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:49,256 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-08 01:25:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-08 01:25:49,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:25:49,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:25:49,262 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-08 01:25:49,263 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-08 01:25:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:49,268 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-08 01:25:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-08 01:25:49,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:25:49,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:25:49,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:25:49,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:25:49,271 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-08 01:25:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-08 01:25:49,276 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 38 [2022-04-08 01:25:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:25:49,276 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-08 01:25:49,277 INFO L479 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-08 01:25:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-08 01:25:49,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 01:25:49,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:25:49,279 INFO L499 BasicCegarLoop]: 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-08 01:25:49,308 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-08 01:25:49,495 WARN L460 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-08 01:25:49,495 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:25:49,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:25:49,496 INFO L85 PathProgramCache]: Analyzing trace with hash 5711864, now seen corresponding path program 1 times [2022-04-08 01:25:49,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:25:49,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641191237] [2022-04-08 01:25:49,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:25:49,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:25:49,511 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:25:49,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [123283517] [2022-04-08 01:25:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:25:49,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:25:49,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:25:49,520 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-08 01:25:49,554 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-08 01:25:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:49,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 01:25:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:49,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:25:51,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {1179#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1179#true} {1179#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {1179#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,031 INFO L272 TraceCheckUtils]: 6: Hoare triple {1179#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 5) 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] {1179#true} is VALID [2022-04-08 01:25:51,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {1179#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[] {1179#true} is VALID [2022-04-08 01:25:51,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,032 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1179#true} {1179#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) 5) 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] {1179#true} is VALID [2022-04-08 01:25:51,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,032 INFO L272 TraceCheckUtils]: 12: Hoare triple {1179#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 5) 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] {1179#true} is VALID [2022-04-08 01:25:51,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#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] {1223#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 01:25:51,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {1223#(= 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[] {1227#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 01:25:51,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#(not (= |assume_abort_if_not_#in~cond| 0))} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1227#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 01:25:51,039 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1227#(not (= |assume_abort_if_not_#in~cond| 0))} {1179#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) 5) 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] {1234#(<= (mod main_~B~0 4294967296) 5)} is VALID [2022-04-08 01:25:51,039 INFO L272 TraceCheckUtils]: 17: Hoare triple {1234#(<= (mod main_~B~0 4294967296) 5)} [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] {1179#true} is VALID [2022-04-08 01:25:51,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {1179#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[] {1179#true} is VALID [2022-04-08 01:25:51,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,040 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1179#true} {1234#(<= (mod main_~B~0 4294967296) 5)} [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] {1234#(<= (mod main_~B~0 4294967296) 5)} is VALID [2022-04-08 01:25:51,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {1234#(<= (mod main_~B~0 4294967296) 5)} [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] {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 01:25:51,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 01:25:51,041 INFO L272 TraceCheckUtils]: 24: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= 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] {1179#true} is VALID [2022-04-08 01:25:51,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {1179#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[] {1179#true} is VALID [2022-04-08 01:25:51,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {1179#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,043 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1179#true} {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= 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] {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 01:25:51,043 INFO L272 TraceCheckUtils]: 29: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= 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] {1179#true} is VALID [2022-04-08 01:25:51,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {1179#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[] {1179#true} is VALID [2022-04-08 01:25:51,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {1179#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,044 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1179#true} {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= 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] {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 01:25:51,044 INFO L272 TraceCheckUtils]: 34: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= 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] {1179#true} is VALID [2022-04-08 01:25:51,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#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[] {1179#true} is VALID [2022-04-08 01:25:51,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {1179#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,045 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1179#true} {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= 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] {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 01:25:51,046 INFO L290 TraceCheckUtils]: 39: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= 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[] {1305#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-08 01:25:51,046 INFO L290 TraceCheckUtils]: 40: Hoare triple {1305#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [124] L54-2-->L47: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1305#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-08 01:25:51,049 INFO L272 TraceCheckUtils]: 41: Hoare triple {1305#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (not (<= (mod main_~B~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] {1312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:25:51,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {1312#(<= 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] {1316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:25:51,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {1316#(<= 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[] {1180#false} is VALID [2022-04-08 01:25:51,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {1180#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1180#false} is VALID [2022-04-08 01:25:51,052 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-08 01:25:51,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 01:25:51,603 INFO L290 TraceCheckUtils]: 44: Hoare triple {1180#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1180#false} is VALID [2022-04-08 01:25:51,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {1316#(<= 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[] {1180#false} is VALID [2022-04-08 01:25:51,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {1312#(<= 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] {1316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:25:51,606 INFO L272 TraceCheckUtils]: 41: Hoare triple {1332#(= (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] {1312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:25:51,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {1332#(= (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[] {1332#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-08 01:25:51,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {1339#(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[] {1332#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-08 01:25:51,608 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1179#true} {1339#(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] {1339#(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-08 01:25:51,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {1179#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#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[] {1179#true} is VALID [2022-04-08 01:25:51,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,608 INFO L272 TraceCheckUtils]: 34: Hoare triple {1339#(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] {1179#true} is VALID [2022-04-08 01:25:51,610 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1179#true} {1339#(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] {1339#(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-08 01:25:51,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {1179#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {1179#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[] {1179#true} is VALID [2022-04-08 01:25:51,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,610 INFO L272 TraceCheckUtils]: 29: Hoare triple {1339#(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] {1179#true} is VALID [2022-04-08 01:25:51,611 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1179#true} {1339#(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] {1339#(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-08 01:25:51,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {1179#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {1179#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[] {1179#true} is VALID [2022-04-08 01:25:51,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,611 INFO L272 TraceCheckUtils]: 24: Hoare triple {1339#(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] {1179#true} is VALID [2022-04-08 01:25:51,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {1339#(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[] {1339#(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-08 01:25:51,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {1179#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] {1339#(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-08 01:25:51,624 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1179#true} {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {1179#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[] {1179#true} is VALID [2022-04-08 01:25:51,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,625 INFO L272 TraceCheckUtils]: 17: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,628 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1179#true} {1179#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) 5) 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] {1179#true} is VALID [2022-04-08 01:25:51,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#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[] {1179#true} is VALID [2022-04-08 01:25:51,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,636 INFO L272 TraceCheckUtils]: 12: Hoare triple {1179#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 5) 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] {1179#true} is VALID [2022-04-08 01:25:51,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,637 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1179#true} {1179#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) 5) 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] {1179#true} is VALID [2022-04-08 01:25:51,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {1179#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[] {1179#true} is VALID [2022-04-08 01:25:51,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,637 INFO L272 TraceCheckUtils]: 6: Hoare triple {1179#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 5) 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] {1179#true} is VALID [2022-04-08 01:25:51,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {1179#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1179#true} {1179#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {1179#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#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] {1179#true} is VALID [2022-04-08 01:25:51,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-08 01:25:51,638 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-08 01:25:51,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:25:51,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641191237] [2022-04-08 01:25:51,639 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:25:51,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123283517] [2022-04-08 01:25:51,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123283517] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 01:25:51,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 01:25:51,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-08 01:25:51,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059111971] [2022-04-08 01:25:51,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:25:51,657 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-08 01:25:51,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:25:51,657 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-08 01:25:51,696 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-08 01:25:51,697 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 01:25:51,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:25:51,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 01:25:51,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-08 01:25:51,698 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-08 01:25:54,054 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-08 01:25:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:54,203 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-04-08 01:25:54,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 01:25:54,204 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-08 01:25:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:25:54,204 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-08 01:25:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-08 01:25:54,206 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-08 01:25:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-08 01:25:54,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-08 01:25:54,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:25:54,273 INFO L225 Difference]: With dead ends: 68 [2022-04-08 01:25:54,273 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 01:25:54,273 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 01:25:54,274 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 16 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 01:25:54,274 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 130 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 01:25:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 01:25:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-08 01:25:54,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:25:54,287 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-08 01:25:54,289 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-08 01:25:54,291 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-08 01:25:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:54,294 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-08 01:25:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-08 01:25:54,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:25:54,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:25:54,297 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-08 01:25:54,298 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-08 01:25:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:25:54,302 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-08 01:25:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-08 01:25:54,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:25:54,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:25:54,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:25:54,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:25:54,303 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-08 01:25:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-04-08 01:25:54,305 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 45 [2022-04-08 01:25:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:25:54,306 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-04-08 01:25:54,306 INFO L479 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-08 01:25:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-08 01:25:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 01:25:54,308 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:25:54,308 INFO L499 BasicCegarLoop]: 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-08 01:25:54,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 01:25:54,531 WARN L460 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-08 01:25:54,532 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:25:54,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:25:54,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1597443315, now seen corresponding path program 1 times [2022-04-08 01:25:54,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:25:54,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398326109] [2022-04-08 01:25:54,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:25:54,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:25:54,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:25:54,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029402131] [2022-04-08 01:25:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:25:54,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:25:54,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:25:54,554 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-08 01:25:54,573 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-08 01:25:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:54,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 01:25:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:25:54,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:25:54,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {1787#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:54,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:54,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {1787#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:54,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1787#true} {1787#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:54,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {1787#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:54,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:54,881 INFO L272 TraceCheckUtils]: 6: Hoare triple {1787#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 5) 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] {1787#true} is VALID [2022-04-08 01:25:54,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:54,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:54,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {1787#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:54,881 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1787#true} {1787#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) 5) 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] {1787#true} is VALID [2022-04-08 01:25:54,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:54,881 INFO L272 TraceCheckUtils]: 12: Hoare triple {1787#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 5) 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] {1787#true} is VALID [2022-04-08 01:25:54,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:54,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:54,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {1787#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:54,882 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1787#true} {1787#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) 5) 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] {1787#true} is VALID [2022-04-08 01:25:54,882 INFO L272 TraceCheckUtils]: 17: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:54,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:54,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:54,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {1787#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:54,883 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1787#true} {1787#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] {1787#true} is VALID [2022-04-08 01:25:54,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {1787#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] {1858#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:25:54,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {1858#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1858#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:25:54,888 INFO L272 TraceCheckUtils]: 24: Hoare triple {1858#(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] {1787#true} is VALID [2022-04-08 01:25:54,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:54,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:54,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {1787#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:54,889 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1787#true} {1858#(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] {1858#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:25:54,889 INFO L272 TraceCheckUtils]: 29: Hoare triple {1858#(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] {1787#true} is VALID [2022-04-08 01:25:54,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:54,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:54,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {1787#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:54,891 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1787#true} {1858#(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] {1858#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:25:54,891 INFO L272 TraceCheckUtils]: 34: Hoare triple {1858#(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] {1787#true} is VALID [2022-04-08 01:25:54,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:54,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:54,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {1787#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:54,892 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1787#true} {1858#(and (= 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] {1858#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:25:54,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {1858#(and (= 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] {1910#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-08 01:25:54,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {1910#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1910#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-08 01:25:54,893 INFO L272 TraceCheckUtils]: 41: Hoare triple {1910#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [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] {1787#true} is VALID [2022-04-08 01:25:54,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:54,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:54,893 INFO L290 TraceCheckUtils]: 44: Hoare triple {1787#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:54,894 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1787#true} {1910#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [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] {1910#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-08 01:25:54,894 INFO L272 TraceCheckUtils]: 46: Hoare triple {1910#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [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] {1787#true} is VALID [2022-04-08 01:25:54,894 INFO L290 TraceCheckUtils]: 47: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:54,894 INFO L290 TraceCheckUtils]: 48: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:54,894 INFO L290 TraceCheckUtils]: 49: Hoare triple {1787#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:54,895 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1787#true} {1910#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [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] {1910#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-08 01:25:54,898 INFO L272 TraceCheckUtils]: 51: Hoare triple {1910#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [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] {1947#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:25:54,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {1947#(<= 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] {1951#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:25:54,899 INFO L290 TraceCheckUtils]: 53: Hoare triple {1951#(<= 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[] {1788#false} is VALID [2022-04-08 01:25:54,899 INFO L290 TraceCheckUtils]: 54: Hoare triple {1788#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1788#false} is VALID [2022-04-08 01:25:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-08 01:25:54,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 01:25:55,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {1788#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1788#false} is VALID [2022-04-08 01:25:55,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {1951#(<= 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[] {1788#false} is VALID [2022-04-08 01:25:55,174 INFO L290 TraceCheckUtils]: 52: Hoare triple {1947#(<= 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] {1951#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:25:55,174 INFO L272 TraceCheckUtils]: 51: Hoare triple {1967#(= (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] {1947#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:25:55,175 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1787#true} {1967#(= (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] {1967#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 01:25:55,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {1787#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:55,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:55,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:55,176 INFO L272 TraceCheckUtils]: 46: Hoare triple {1967#(= (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] {1787#true} is VALID [2022-04-08 01:25:55,177 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1787#true} {1967#(= (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] {1967#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 01:25:55,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {1787#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:55,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:55,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:55,177 INFO L272 TraceCheckUtils]: 41: Hoare triple {1967#(= (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] {1787#true} is VALID [2022-04-08 01:25:55,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {1967#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1967#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 01:25:57,188 WARN L290 TraceCheckUtils]: 39: Hoare triple {2004#(= (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] {1967#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-08 01:25:57,189 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1787#true} {2004#(= (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] {2004#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-08 01:25:57,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {1787#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:57,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:57,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:57,190 INFO L272 TraceCheckUtils]: 34: Hoare triple {2004#(= (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] {1787#true} is VALID [2022-04-08 01:25:57,190 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1787#true} {2004#(= (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] {2004#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-08 01:25:57,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {1787#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:57,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:57,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:57,191 INFO L272 TraceCheckUtils]: 29: Hoare triple {2004#(= (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] {1787#true} is VALID [2022-04-08 01:25:57,191 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1787#true} {2004#(= (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] {2004#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-08 01:25:57,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {1787#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:57,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:57,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:57,191 INFO L272 TraceCheckUtils]: 24: Hoare triple {2004#(= (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] {1787#true} is VALID [2022-04-08 01:25:57,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {2004#(= (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[] {2004#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-08 01:25:57,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {1787#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] {2004#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-08 01:25:57,192 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1787#true} {1787#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] {1787#true} is VALID [2022-04-08 01:25:57,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {1787#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:57,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:57,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:57,193 INFO L272 TraceCheckUtils]: 17: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:57,193 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1787#true} {1787#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) 5) 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] {1787#true} is VALID [2022-04-08 01:25:57,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {1787#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:57,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:57,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:57,193 INFO L272 TraceCheckUtils]: 12: Hoare triple {1787#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 5) 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] {1787#true} is VALID [2022-04-08 01:25:57,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:57,194 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1787#true} {1787#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) 5) 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] {1787#true} is VALID [2022-04-08 01:25:57,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {1787#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:57,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {1787#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[] {1787#true} is VALID [2022-04-08 01:25:57,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:57,194 INFO L272 TraceCheckUtils]: 6: Hoare triple {1787#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 5) 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] {1787#true} is VALID [2022-04-08 01:25:57,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:57,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {1787#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:57,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1787#true} {1787#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:57,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {1787#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:57,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#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] {1787#true} is VALID [2022-04-08 01:25:57,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {1787#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1787#true} is VALID [2022-04-08 01:25:57,195 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-08 01:25:57,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:25:57,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398326109] [2022-04-08 01:25:57,196 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:25:57,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029402131] [2022-04-08 01:25:57,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029402131] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 01:25:57,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 01:25:57,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-08 01:25:57,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024424881] [2022-04-08 01:25:57,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:25:57,197 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-08 01:25:57,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:25:57,198 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-08 01:25:58,197 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-08 01:25:58,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 01:25:58,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:25:58,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 01:25:58,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-08 01:25:58,198 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-08 01:26:01,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 01:26:03,510 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-08 01:26:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:26:04,892 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-08 01:26:04,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 01:26:04,892 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-08 01:26:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:26:04,893 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-08 01:26:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-08 01:26:04,894 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-08 01:26:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-08 01:26:04,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-08 01:26:06,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 01:26:06,965 INFO L225 Difference]: With dead ends: 76 [2022-04-08 01:26:06,966 INFO L226 Difference]: Without dead ends: 74 [2022-04-08 01:26:06,966 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-08 01:26:06,967 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-08 01:26:06,967 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 131 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2022-04-08 01:26:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-08 01:26:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-04-08 01:26:06,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:26:06,978 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-08 01:26:06,978 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-08 01:26:06,978 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-08 01:26:06,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:26:06,981 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-08 01:26:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-08 01:26:06,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:26:06,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:26:06,982 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-08 01:26:06,982 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-08 01:26:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:26:06,985 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-08 01:26:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-08 01:26:06,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:26:06,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:26:06,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:26:06,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:26:06,986 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-08 01:26:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2022-04-08 01:26:06,988 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 55 [2022-04-08 01:26:06,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:26:06,988 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2022-04-08 01:26:06,989 INFO L479 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-08 01:26:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2022-04-08 01:26:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 01:26:06,989 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:26:06,989 INFO L499 BasicCegarLoop]: 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-08 01:26:06,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 01:26:07,190 WARN L460 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-08 01:26:07,190 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:26:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:26:07,191 INFO L85 PathProgramCache]: Analyzing trace with hash 810354846, now seen corresponding path program 1 times [2022-04-08 01:26:07,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:26:07,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807722323] [2022-04-08 01:26:07,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:26:07,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:26:07,202 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:26:07,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481595054] [2022-04-08 01:26:07,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:26:07,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:26:07,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:26:07,204 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-08 01:26:07,230 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-08 01:26:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:26:07,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 01:26:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:26:07,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:26:09,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {2489#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:09,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:09,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {2489#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:09,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2489#true} {2489#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:09,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {2489#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:09,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:09,484 INFO L272 TraceCheckUtils]: 6: Hoare triple {2489#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 5) 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] {2489#true} is VALID [2022-04-08 01:26:09,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:09,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:09,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {2489#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:09,485 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2489#true} {2489#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) 5) 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] {2489#true} is VALID [2022-04-08 01:26:09,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:09,485 INFO L272 TraceCheckUtils]: 12: Hoare triple {2489#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 5) 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] {2489#true} is VALID [2022-04-08 01:26:09,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {2489#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] {2533#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 01:26:09,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {2533#(= 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[] {2537#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 01:26:09,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {2537#(not (= |assume_abort_if_not_#in~cond| 0))} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 01:26:09,502 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2537#(not (= |assume_abort_if_not_#in~cond| 0))} {2489#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) 5) 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] {2544#(<= (mod main_~B~0 4294967296) 5)} is VALID [2022-04-08 01:26:09,502 INFO L272 TraceCheckUtils]: 17: Hoare triple {2544#(<= (mod main_~B~0 4294967296) 5)} [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] {2489#true} is VALID [2022-04-08 01:26:09,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:09,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:09,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {2489#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:09,503 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2489#true} {2544#(<= (mod main_~B~0 4294967296) 5)} [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] {2544#(<= (mod main_~B~0 4294967296) 5)} is VALID [2022-04-08 01:26:09,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {2544#(<= (mod main_~B~0 4294967296) 5)} [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] {2563#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 01:26:09,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {2563#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2563#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 01:26:09,504 INFO L272 TraceCheckUtils]: 24: Hoare triple {2563#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [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] {2489#true} is VALID [2022-04-08 01:26:09,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:09,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:09,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {2489#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:09,505 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2489#true} {2563#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [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] {2563#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 01:26:09,505 INFO L272 TraceCheckUtils]: 29: Hoare triple {2563#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [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] {2489#true} is VALID [2022-04-08 01:26:09,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:09,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:09,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {2489#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:09,506 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2489#true} {2563#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [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] {2563#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 01:26:09,506 INFO L272 TraceCheckUtils]: 34: Hoare triple {2563#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [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] {2489#true} is VALID [2022-04-08 01:26:09,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:09,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:09,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {2489#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:09,507 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2489#true} {2563#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [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] {2563#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 01:26:09,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {2563#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [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[] {2615#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 01:26:09,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {2615#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [124] L54-2-->L47: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 01:26:09,508 INFO L272 TraceCheckUtils]: 41: Hoare triple {2615#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [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] {2489#true} is VALID [2022-04-08 01:26:09,508 INFO L290 TraceCheckUtils]: 42: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:09,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:09,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {2489#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:09,509 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2489#true} {2615#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [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] {2615#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 01:26:09,509 INFO L272 TraceCheckUtils]: 46: Hoare triple {2615#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [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] {2489#true} is VALID [2022-04-08 01:26:09,510 INFO L290 TraceCheckUtils]: 47: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:09,510 INFO L290 TraceCheckUtils]: 48: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:09,510 INFO L290 TraceCheckUtils]: 49: Hoare triple {2489#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:09,510 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2489#true} {2615#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [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] {2615#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 01:26:09,511 INFO L290 TraceCheckUtils]: 51: Hoare triple {2615#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [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[] {2615#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 01:26:09,512 INFO L272 TraceCheckUtils]: 52: Hoare triple {2615#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} [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] {2655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:26:09,512 INFO L290 TraceCheckUtils]: 53: Hoare triple {2655#(<= 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] {2659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:26:09,512 INFO L290 TraceCheckUtils]: 54: Hoare triple {2659#(<= 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[] {2490#false} is VALID [2022-04-08 01:26:09,513 INFO L290 TraceCheckUtils]: 55: Hoare triple {2490#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2490#false} is VALID [2022-04-08 01:26:09,513 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-08 01:26:09,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 01:26:11,069 INFO L290 TraceCheckUtils]: 55: Hoare triple {2490#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2490#false} is VALID [2022-04-08 01:26:11,070 INFO L290 TraceCheckUtils]: 54: Hoare triple {2659#(<= 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[] {2490#false} is VALID [2022-04-08 01:26:11,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {2655#(<= 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] {2659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:26:11,094 INFO L272 TraceCheckUtils]: 52: Hoare triple {2675#(= (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] {2655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:26:11,094 INFO L290 TraceCheckUtils]: 51: Hoare triple {2675#(= (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[] {2675#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 01:26:11,095 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2489#true} {2675#(= (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] {2675#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 01:26:11,095 INFO L290 TraceCheckUtils]: 49: Hoare triple {2489#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:11,095 INFO L290 TraceCheckUtils]: 48: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:11,095 INFO L290 TraceCheckUtils]: 47: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:11,096 INFO L272 TraceCheckUtils]: 46: Hoare triple {2675#(= (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] {2489#true} is VALID [2022-04-08 01:26:11,096 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2489#true} {2675#(= (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] {2675#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 01:26:11,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {2489#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:11,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:11,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:11,097 INFO L272 TraceCheckUtils]: 41: Hoare triple {2675#(= (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] {2489#true} is VALID [2022-04-08 01:26:11,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {2675#(= (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[] {2675#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 01:26:11,098 INFO L290 TraceCheckUtils]: 39: Hoare triple {2715#(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[] {2675#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 01:26:11,098 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2489#true} {2715#(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] {2715#(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-08 01:26:11,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {2489#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:11,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:11,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:11,099 INFO L272 TraceCheckUtils]: 34: Hoare triple {2715#(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] {2489#true} is VALID [2022-04-08 01:26:11,099 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2489#true} {2715#(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] {2715#(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-08 01:26:11,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {2489#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:11,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:11,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:11,102 INFO L272 TraceCheckUtils]: 29: Hoare triple {2715#(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] {2489#true} is VALID [2022-04-08 01:26:11,103 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2489#true} {2715#(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] {2715#(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-08 01:26:11,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {2489#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:11,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:11,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:11,103 INFO L272 TraceCheckUtils]: 24: Hoare triple {2715#(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] {2489#true} is VALID [2022-04-08 01:26:11,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {2715#(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[] {2715#(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-08 01:26:11,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {2489#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] {2715#(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-08 01:26:11,104 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2489#true} {2489#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] {2489#true} is VALID [2022-04-08 01:26:11,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {2489#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:11,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:11,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:11,104 INFO L272 TraceCheckUtils]: 17: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:11,105 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2489#true} {2489#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) 5) 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] {2489#true} is VALID [2022-04-08 01:26:11,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {2489#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:11,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:11,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:11,105 INFO L272 TraceCheckUtils]: 12: Hoare triple {2489#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 5) 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] {2489#true} is VALID [2022-04-08 01:26:11,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:11,105 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2489#true} {2489#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) 5) 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] {2489#true} is VALID [2022-04-08 01:26:11,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {2489#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:11,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {2489#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[] {2489#true} is VALID [2022-04-08 01:26:11,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:11,106 INFO L272 TraceCheckUtils]: 6: Hoare triple {2489#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~A~0_9 4294967296) 5) 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] {2489#true} is VALID [2022-04-08 01:26:11,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:11,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {2489#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:11,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2489#true} {2489#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:11,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {2489#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:11,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {2489#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] {2489#true} is VALID [2022-04-08 01:26:11,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {2489#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2489#true} is VALID [2022-04-08 01:26:11,107 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-08 01:26:11,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:26:11,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807722323] [2022-04-08 01:26:11,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:26:11,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481595054] [2022-04-08 01:26:11,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481595054] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 01:26:11,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 01:26:11,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-08 01:26:11,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604056609] [2022-04-08 01:26:11,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:26:11,109 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-08 01:26:11,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:26:11,110 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-08 01:26:11,147 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-08 01:26:11,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 01:26:11,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:26:11,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 01:26:11,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-08 01:26:11,149 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-08 01:26:18,201 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-08 01:26:20,312 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 01:26:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:26:21,436 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2022-04-08 01:26:21,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 01:26:21,437 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-08 01:26:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:26:21,437 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-08 01:26:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 01:26:21,439 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-08 01:26:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 01:26:21,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 01:26:21,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:26:21,509 INFO L225 Difference]: With dead ends: 77 [2022-04-08 01:26:21,509 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 01:26:21,509 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-08 01:26:21,510 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-08 01:26:21,510 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 178 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 2 Unknown, 0 Unchecked, 5.3s Time] [2022-04-08 01:26:21,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 01:26:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 01:26:21,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:26:21,520 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-08 01:26:21,521 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-08 01:26:21,521 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-08 01:26:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:26:21,523 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-04-08 01:26:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-08 01:26:21,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:26:21,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:26:21,524 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-08 01:26:21,524 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-08 01:26:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:26:21,528 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-04-08 01:26:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-08 01:26:21,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:26:21,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:26:21,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:26:21,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:26:21,529 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-08 01:26:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-08 01:26:21,532 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 56 [2022-04-08 01:26:21,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:26:21,533 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-08 01:26:21,533 INFO L479 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-08 01:26:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-08 01:26:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 01:26:21,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:26:21,534 INFO L499 BasicCegarLoop]: 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-08 01:26:21,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 01:26:21,751 WARN L460 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-08 01:26:21,752 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:26:21,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:26:21,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1535015126, now seen corresponding path program 1 times [2022-04-08 01:26:21,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:26:21,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597143408] [2022-04-08 01:26:21,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:26:21,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:26:21,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:26:21,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101930555] [2022-04-08 01:26:21,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:26:21,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:26:21,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:26:21,780 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-08 01:26:21,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process