/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/hard2_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 01:37:49,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 01:37:49,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 01:37:49,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 01:37:49,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 01:37:49,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 01:37:49,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 01:37:49,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 01:37:49,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 01:37:49,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 01:37:49,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 01:37:49,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 01:37:49,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 01:37:49,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 01:37:49,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 01:37:49,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 01:37:49,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 01:37:49,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 01:37:49,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 01:37:49,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 01:37:49,077 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 01:37:49,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 01:37:49,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 01:37:49,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 01:37:49,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 01:37:49,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 01:37:49,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 01:37:49,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 01:37:49,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 01:37:49,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 01:37:49,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 01:37:49,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 01:37:49,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 01:37:49,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 01:37:49,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 01:37:49,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 01:37:49,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 01:37:49,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 01:37:49,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 01:37:49,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 01:37:49,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 01:37:49,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 01:37:49,101 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:37:49,122 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 01:37:49,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 01:37:49,123 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 01:37:49,123 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 01:37:49,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 01:37:49,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 01:37:49,124 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 01:37:49,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 01:37:49,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 01:37:49,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 01:37:49,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 01:37:49,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 01:37:49,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 01:37:49,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 01:37:49,125 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 01:37:49,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 01:37:49,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 01:37:49,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 01:37:49,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 01:37:49,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 01:37:49,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 01:37:49,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 01:37:49,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 01:37:49,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 01:37:49,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 01:37:49,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 01:37:49,126 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 01:37:49,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 01:37:49,127 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 01:37:49,127 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:37:49,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 01:37:49,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 01:37:49,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 01:37:49,347 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 01:37:49,348 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 01:37:49,349 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_valuebound1.c [2022-04-08 01:37:49,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43b7dc79/ddd6cc02040044fd82633dce86a52804/FLAGdd9a7adf8 [2022-04-08 01:37:49,766 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 01:37:49,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_valuebound1.c [2022-04-08 01:37:49,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43b7dc79/ddd6cc02040044fd82633dce86a52804/FLAGdd9a7adf8 [2022-04-08 01:37:49,787 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43b7dc79/ddd6cc02040044fd82633dce86a52804 [2022-04-08 01:37:49,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 01:37:49,790 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 01:37:49,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 01:37:49,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 01:37:49,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 01:37:49,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:37:49" (1/1) ... [2022-04-08 01:37:49,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299e23c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:37:49, skipping insertion in model container [2022-04-08 01:37:49,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:37:49" (1/1) ... [2022-04-08 01:37:49,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 01:37:49,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 01:37:49,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_valuebound1.c[526,539] [2022-04-08 01:37:49,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 01:37:49,933 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 01:37:49,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_valuebound1.c[526,539] [2022-04-08 01:37:49,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 01:37:49,958 INFO L208 MainTranslator]: Completed translation [2022-04-08 01:37:49,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:37:49 WrapperNode [2022-04-08 01:37:49,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 01:37:49,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 01:37:49,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 01:37:49,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 01:37:49,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:37:49" (1/1) ... [2022-04-08 01:37:49,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:37:49" (1/1) ... [2022-04-08 01:37:49,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:37:49" (1/1) ... [2022-04-08 01:37:49,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:37:49" (1/1) ... [2022-04-08 01:37:49,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:37:49" (1/1) ... [2022-04-08 01:37:49,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:37:49" (1/1) ... [2022-04-08 01:37:49,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:37:49" (1/1) ... [2022-04-08 01:37:49,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 01:37:49,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 01:37:49,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 01:37:49,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 01:37:49,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:37:49" (1/1) ... [2022-04-08 01:37:49,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 01:37:50,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:37:50,012 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:37:50,018 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:37:50,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 01:37:50,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 01:37:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 01:37:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 01:37:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 01:37:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 01:37:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 01:37:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 01:37:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 01:37:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 01:37:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 01:37:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 01:37:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 01:37:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 01:37:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 01:37:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 01:37:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 01:37:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 01:37:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 01:37:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 01:37:50,086 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 01:37:50,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 01:37:50,181 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 01:37:50,186 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 01:37:50,186 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 01:37:50,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:37:50 BoogieIcfgContainer [2022-04-08 01:37:50,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 01:37:50,188 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 01:37:50,188 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 01:37:50,189 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 01:37:50,191 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:37:50" (1/1) ... [2022-04-08 01:37:50,192 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 01:37:50,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:37:50 BasicIcfg [2022-04-08 01:37:50,208 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 01:37:50,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 01:37:50,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 01:37:50,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 01:37:50,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 01:37:49" (1/4) ... [2022-04-08 01:37:50,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3206d09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:37:50, skipping insertion in model container [2022-04-08 01:37:50,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:37:49" (2/4) ... [2022-04-08 01:37:50,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3206d09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:37:50, skipping insertion in model container [2022-04-08 01:37:50,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:37:50" (3/4) ... [2022-04-08 01:37:50,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3206d09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 01:37:50, skipping insertion in model container [2022-04-08 01:37:50,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:37:50" (4/4) ... [2022-04-08 01:37:50,213 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_valuebound1.cqvasr [2022-04-08 01:37:50,216 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 01:37:50,216 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 01:37:50,242 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 01:37:50,246 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:37:50,246 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 01:37:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 01:37:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 01:37:50,261 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:37:50,261 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:37:50,261 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:37:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:37:50,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1625753047, now seen corresponding path program 1 times [2022-04-08 01:37:50,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:37:50,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483059908] [2022-04-08 01:37:50,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:37:50,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:37:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:50,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 01:37:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:50,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {38#true} is VALID [2022-04-08 01:37:50,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-08 01:37:50,390 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-08 01:37:50,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 01:37:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:50,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} [105] 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] {38#true} is VALID [2022-04-08 01:37:50,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [109] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-08 01:37:50,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-08 01:37:50,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {39#false} is VALID [2022-04-08 01:37:50,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 01:37:50,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {38#true} is VALID [2022-04-08 01:37:50,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-08 01:37:50,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-08 01:37:50,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-08 01:37:50,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {38#true} is VALID [2022-04-08 01:37:50,401 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {38#true} is VALID [2022-04-08 01:37:50,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} [105] 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] {38#true} is VALID [2022-04-08 01:37:50,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} [109] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-08 01:37:50,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-08 01:37:50,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {39#false} is VALID [2022-04-08 01:37:50,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {39#false} is VALID [2022-04-08 01:37:50,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-08 01:37:50,403 INFO L272 TraceCheckUtils]: 13: Hoare triple {39#false} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {39#false} is VALID [2022-04-08 01:37:50,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} [119] __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] {39#false} is VALID [2022-04-08 01:37:50,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} [123] 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[] {39#false} is VALID [2022-04-08 01:37:50,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-08 01:37:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 01:37:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:37:50,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483059908] [2022-04-08 01:37:50,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483059908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:37:50,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:37:50,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 01:37:50,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888088532] [2022-04-08 01:37:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:37:50,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 01:37:50,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:37:50,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 01:37:50,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:37:50,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 01:37:50,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:37:50,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 01:37:50,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 01:37:50,448 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 01:37:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:50,553 INFO L93 Difference]: Finished difference Result 61 states and 95 transitions. [2022-04-08 01:37:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 01:37:50,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 01:37:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:37:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 01:37:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 01:37:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 01:37:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 01:37:50,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-08 01:37:50,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:37:50,670 INFO L225 Difference]: With dead ends: 61 [2022-04-08 01:37:50,670 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 01:37:50,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 01:37:50,675 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 01:37:50,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 01:37:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 01:37:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 01:37:50,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:37:50,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:37:50,696 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:37:50,697 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:37:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:50,700 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-08 01:37:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-08 01:37:50,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:37:50,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:37:50,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-08 01:37:50,701 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-08 01:37:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:50,703 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-08 01:37:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-08 01:37:50,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:37:50,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:37:50,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:37:50,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:37:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:37:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-08 01:37:50,707 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-04-08 01:37:50,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:37:50,707 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-08 01:37:50,708 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 01:37:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-08 01:37:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 01:37:50,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:37:50,708 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:37:50,709 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 01:37:50,709 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:37:50,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:37:50,709 INFO L85 PathProgramCache]: Analyzing trace with hash 861759786, now seen corresponding path program 1 times [2022-04-08 01:37:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:37:50,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364712998] [2022-04-08 01:37:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:37:50,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:37:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 01:37:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:50,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {240#true} is VALID [2022-04-08 01:37:50,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-08 01:37:50,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {240#true} {240#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-08 01:37:50,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 01:37:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:50,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#true} [105] 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] {240#true} is VALID [2022-04-08 01:37:50,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} [110] 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[] {240#true} is VALID [2022-04-08 01:37:50,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-08 01:37:50,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {240#true} is VALID [2022-04-08 01:37:50,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {240#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 01:37:50,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {240#true} is VALID [2022-04-08 01:37:50,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-08 01:37:50,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-08 01:37:50,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-08 01:37:50,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {240#true} is VALID [2022-04-08 01:37:50,783 INFO L272 TraceCheckUtils]: 6: Hoare triple {240#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {240#true} is VALID [2022-04-08 01:37:50,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#true} [105] 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] {240#true} is VALID [2022-04-08 01:37:50,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#true} [110] 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[] {240#true} is VALID [2022-04-08 01:37:50,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-08 01:37:50,784 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {240#true} {240#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {240#true} is VALID [2022-04-08 01:37:50,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {249#(= main_~q~0 0)} is VALID [2022-04-08 01:37:50,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#(= main_~q~0 0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#(= main_~q~0 0)} is VALID [2022-04-08 01:37:50,785 INFO L272 TraceCheckUtils]: 13: Hoare triple {249#(= main_~q~0 0)} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {250#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:37:50,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {250#(not (= |__VERIFIER_assert_#in~cond| 0))} [119] __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] {251#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 01:37:50,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {251#(not (= __VERIFIER_assert_~cond 0))} [123] 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[] {241#false} is VALID [2022-04-08 01:37:50,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {241#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#false} is VALID [2022-04-08 01:37:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 01:37:50,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:37:50,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364712998] [2022-04-08 01:37:50,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364712998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:37:50,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:37:50,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 01:37:50,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929514506] [2022-04-08 01:37:50,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:37:50,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 01:37:50,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:37:50,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 01:37:50,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:37:50,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 01:37:50,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:37:50,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 01:37:50,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 01:37:50,801 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 01:37:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:51,318 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-08 01:37:51,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 01:37:51,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 01:37:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:37:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 01:37:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 01:37:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 01:37:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 01:37:51,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-08 01:37:51,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:37:51,395 INFO L225 Difference]: With dead ends: 43 [2022-04-08 01:37:51,395 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 01:37:51,398 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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:37:51,415 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 01:37:51,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 45 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 01:37:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 01:37:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-08 01:37:51,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:37:51,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:37:51,426 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:37:51,427 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:37:51,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:51,432 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-08 01:37:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-08 01:37:51,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:37:51,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:37:51,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-08 01:37:51,440 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-08 01:37:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:51,445 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-08 01:37:51,446 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-08 01:37:51,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:37:51,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:37:51,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:37:51,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:37:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:37:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-08 01:37:51,448 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2022-04-08 01:37:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:37:51,448 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-08 01:37:51,448 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 01:37:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 01:37:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 01:37:51,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:37:51,449 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:37:51,449 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 01:37:51,449 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:37:51,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:37:51,450 INFO L85 PathProgramCache]: Analyzing trace with hash 325569287, now seen corresponding path program 1 times [2022-04-08 01:37:51,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:37:51,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607322045] [2022-04-08 01:37:51,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:37:51,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:37:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:51,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 01:37:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:51,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {458#true} is VALID [2022-04-08 01:37:51,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-08 01:37:51,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-08 01:37:51,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 01:37:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:51,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} [105] 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] {458#true} is VALID [2022-04-08 01:37:51,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [110] 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[] {458#true} is VALID [2022-04-08 01:37:51,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-08 01:37:51,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {458#true} is VALID [2022-04-08 01:37:51,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-08 01:37:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:51,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} [119] __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] {458#true} is VALID [2022-04-08 01:37:51,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [124] 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[] {458#true} is VALID [2022-04-08 01:37:51,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-08 01:37:51,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {467#(= main_~A~0 main_~r~0)} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {467#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 01:37:51,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 01:37:51,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {458#true} is VALID [2022-04-08 01:37:51,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-08 01:37:51,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-08 01:37:51,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-08 01:37:51,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {458#true} is VALID [2022-04-08 01:37:51,631 INFO L272 TraceCheckUtils]: 6: Hoare triple {458#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {458#true} is VALID [2022-04-08 01:37:51,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#true} [105] 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] {458#true} is VALID [2022-04-08 01:37:51,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#true} [110] 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[] {458#true} is VALID [2022-04-08 01:37:51,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-08 01:37:51,632 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {458#true} {458#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {458#true} is VALID [2022-04-08 01:37:51,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {467#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 01:37:51,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#(= main_~A~0 main_~r~0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {467#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 01:37:51,633 INFO L272 TraceCheckUtils]: 13: Hoare triple {467#(= main_~A~0 main_~r~0)} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {458#true} is VALID [2022-04-08 01:37:51,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#true} [119] __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] {458#true} is VALID [2022-04-08 01:37:51,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#true} [124] 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[] {458#true} is VALID [2022-04-08 01:37:51,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {458#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-08 01:37:51,634 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {458#true} {467#(= main_~A~0 main_~r~0)} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {467#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 01:37:51,634 INFO L272 TraceCheckUtils]: 18: Hoare triple {467#(= main_~A~0 main_~r~0)} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:37:51,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {472#(not (= |__VERIFIER_assert_#in~cond| 0))} [119] __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] {473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 01:37:51,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} [123] 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[] {459#false} is VALID [2022-04-08 01:37:51,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {459#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-08 01:37:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 01:37:51,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:37:51,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607322045] [2022-04-08 01:37:51,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607322045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:37:51,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:37:51,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 01:37:51,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682240116] [2022-04-08 01:37:51,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:37:51,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 01:37:51,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:37:51,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:37:51,652 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:37:51,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 01:37:51,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:37:51,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 01:37:51,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 01:37:51,653 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:37:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:52,200 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-08 01:37:52,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 01:37:52,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 01:37:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:37:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:37:52,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 01:37:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:37:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 01:37:52,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-08 01:37:52,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:37:52,249 INFO L225 Difference]: With dead ends: 47 [2022-04-08 01:37:52,249 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 01:37:52,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 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:37:52,250 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 01:37:52,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 45 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 01:37:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 01:37:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-04-08 01:37:52,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:37:52,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:37:52,255 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:37:52,256 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:37:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:52,257 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-08 01:37:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-08 01:37:52,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:37:52,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:37:52,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-08 01:37:52,259 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-08 01:37:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:52,260 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-08 01:37:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-08 01:37:52,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:37:52,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:37:52,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:37:52,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:37:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:37:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-08 01:37:52,262 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2022-04-08 01:37:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:37:52,262 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-08 01:37:52,263 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:37:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-08 01:37:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 01:37:52,263 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:37:52,263 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:37:52,263 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 01:37:52,264 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:37:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:37:52,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1461652409, now seen corresponding path program 1 times [2022-04-08 01:37:52,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:37:52,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536890372] [2022-04-08 01:37:52,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:37:52,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:37:52,275 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:37:52,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905164106] [2022-04-08 01:37:52,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:37:52,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:37:52,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:37:52,276 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:37:52,309 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:37:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:52,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 01:37:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:52,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:37:52,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {698#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#true} is VALID [2022-04-08 01:37:52,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {698#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {698#true} is VALID [2022-04-08 01:37:52,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {698#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#true} is VALID [2022-04-08 01:37:52,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {698#true} {698#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#true} is VALID [2022-04-08 01:37:52,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {698#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#true} is VALID [2022-04-08 01:37:52,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {698#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {698#true} is VALID [2022-04-08 01:37:52,517 INFO L272 TraceCheckUtils]: 6: Hoare triple {698#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {698#true} is VALID [2022-04-08 01:37:52,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {698#true} [105] 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] {698#true} is VALID [2022-04-08 01:37:52,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {698#true} [110] 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[] {698#true} is VALID [2022-04-08 01:37:52,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {698#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#true} is VALID [2022-04-08 01:37:52,517 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {698#true} {698#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {698#true} is VALID [2022-04-08 01:37:52,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {736#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:52,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {736#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {736#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:52,533 INFO L272 TraceCheckUtils]: 13: Hoare triple {736#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {698#true} is VALID [2022-04-08 01:37:52,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {698#true} [119] __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] {698#true} is VALID [2022-04-08 01:37:52,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {698#true} [124] 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[] {698#true} is VALID [2022-04-08 01:37:52,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {698#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#true} is VALID [2022-04-08 01:37:52,534 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {698#true} {736#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {736#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:52,534 INFO L272 TraceCheckUtils]: 18: Hoare triple {736#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {698#true} is VALID [2022-04-08 01:37:52,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {698#true} [119] __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] {698#true} is VALID [2022-04-08 01:37:52,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {698#true} [124] 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[] {698#true} is VALID [2022-04-08 01:37:52,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {698#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#true} is VALID [2022-04-08 01:37:52,535 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {698#true} {736#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {736#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:52,536 INFO L272 TraceCheckUtils]: 23: Hoare triple {736#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:37:52,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {773#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:37:52,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {777#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {699#false} is VALID [2022-04-08 01:37:52,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {699#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {699#false} is VALID [2022-04-08 01:37:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 01:37:52,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 01:37:52,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:37:52,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536890372] [2022-04-08 01:37:52,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:37:52,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905164106] [2022-04-08 01:37:52,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905164106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:37:52,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:37:52,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 01:37:52,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749342416] [2022-04-08 01:37:52,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:37:52,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-08 01:37:52,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:37:52,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 01:37:52,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:37:52,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 01:37:52,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:37:52,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 01:37:52,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 01:37:52,565 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 01:37:52,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:52,703 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-08 01:37:52,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 01:37:52,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-08 01:37:52,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:37:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 01:37:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-08 01:37:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 01:37:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-08 01:37:52,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-08 01:37:52,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:37:52,763 INFO L225 Difference]: With dead ends: 66 [2022-04-08 01:37:52,763 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 01:37:52,763 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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:37:52,764 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 01:37:52,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 128 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 01:37:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 01:37:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 01:37:52,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:37:52,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 01:37:52,770 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 01:37:52,770 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 01:37:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:52,772 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-08 01:37:52,772 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-08 01:37:52,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:37:52,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:37:52,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-08 01:37:52,773 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-08 01:37:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:52,774 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-08 01:37:52,774 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-08 01:37:52,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:37:52,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:37:52,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:37:52,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:37:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 01:37:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-04-08 01:37:52,776 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 27 [2022-04-08 01:37:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:37:52,777 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-04-08 01:37:52,777 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 01:37:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-08 01:37:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 01:37:52,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:37:52,777 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:37:52,796 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:37:52,991 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:37:52,992 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:37:52,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:37:52,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1008917278, now seen corresponding path program 1 times [2022-04-08 01:37:52,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:37:52,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251588622] [2022-04-08 01:37:52,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:37:52,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:37:53,011 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:37:53,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841529243] [2022-04-08 01:37:53,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:37:53,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:37:53,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:37:53,025 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:37:53,044 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:37:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:53,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 01:37:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:53,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:37:53,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {1063#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1063#true} is VALID [2022-04-08 01:37:53,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {1063#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {1063#true} is VALID [2022-04-08 01:37:53,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {1063#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1063#true} is VALID [2022-04-08 01:37:53,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1063#true} {1063#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1063#true} is VALID [2022-04-08 01:37:53,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {1063#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1063#true} is VALID [2022-04-08 01:37:53,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {1063#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1063#true} is VALID [2022-04-08 01:37:53,205 INFO L272 TraceCheckUtils]: 6: Hoare triple {1063#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {1063#true} is VALID [2022-04-08 01:37:53,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {1063#true} [105] 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] {1063#true} is VALID [2022-04-08 01:37:53,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {1063#true} [110] 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[] {1063#true} is VALID [2022-04-08 01:37:53,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {1063#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1063#true} is VALID [2022-04-08 01:37:53,206 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1063#true} {1063#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {1063#true} is VALID [2022-04-08 01:37:53,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:53,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:53,207 INFO L272 TraceCheckUtils]: 13: Hoare triple {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {1063#true} is VALID [2022-04-08 01:37:53,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {1063#true} [119] __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] {1063#true} is VALID [2022-04-08 01:37:53,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {1063#true} [124] 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[] {1063#true} is VALID [2022-04-08 01:37:53,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {1063#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1063#true} is VALID [2022-04-08 01:37:53,208 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1063#true} {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:53,208 INFO L272 TraceCheckUtils]: 18: Hoare triple {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {1063#true} is VALID [2022-04-08 01:37:53,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {1063#true} [119] __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] {1063#true} is VALID [2022-04-08 01:37:53,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {1063#true} [124] 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[] {1063#true} is VALID [2022-04-08 01:37:53,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {1063#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1063#true} is VALID [2022-04-08 01:37:53,209 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1063#true} {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:53,209 INFO L272 TraceCheckUtils]: 23: Hoare triple {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {1063#true} is VALID [2022-04-08 01:37:53,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {1063#true} [119] __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] {1063#true} is VALID [2022-04-08 01:37:53,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {1063#true} [124] 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[] {1063#true} is VALID [2022-04-08 01:37:53,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {1063#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1063#true} is VALID [2022-04-08 01:37:53,210 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1063#true} {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:53,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:53,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:53,211 INFO L272 TraceCheckUtils]: 30: Hoare triple {1101#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {1159#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:37:53,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {1159#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {1163#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:37:53,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {1163#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {1064#false} is VALID [2022-04-08 01:37:53,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {1064#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1064#false} is VALID [2022-04-08 01:37:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 01:37:53,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 01:37:53,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:37:53,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251588622] [2022-04-08 01:37:53,213 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:37:53,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841529243] [2022-04-08 01:37:53,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841529243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:37:53,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:37:53,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 01:37:53,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378030156] [2022-04-08 01:37:53,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:37:53,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 01:37:53,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:37:53,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 01:37:53,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:37:53,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 01:37:53,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:37:53,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 01:37:53,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 01:37:53,231 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 01:37:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:53,373 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2022-04-08 01:37:53,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 01:37:53,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 01:37:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:37:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 01:37:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 01:37:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 01:37:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 01:37:53,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-08 01:37:53,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:37:53,419 INFO L225 Difference]: With dead ends: 65 [2022-04-08 01:37:53,419 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 01:37:53,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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:37:53,420 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 01:37:53,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 97 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 01:37:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 01:37:53,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-04-08 01:37:53,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:37:53,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 01:37:53,427 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 01:37:53,427 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 01:37:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:53,429 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-08 01:37:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-08 01:37:53,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:37:53,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:37:53,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-08 01:37:53,430 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-08 01:37:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:53,431 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-08 01:37:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-08 01:37:53,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:37:53,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:37:53,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:37:53,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:37:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 01:37:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2022-04-08 01:37:53,434 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 34 [2022-04-08 01:37:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:37:53,434 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2022-04-08 01:37:53,434 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 01:37:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-08 01:37:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 01:37:53,434 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:37:53,435 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:37:53,469 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:37:53,647 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:37:53,648 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:37:53,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:37:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1762200840, now seen corresponding path program 1 times [2022-04-08 01:37:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:37:53,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682427456] [2022-04-08 01:37:53,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:37:53,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:37:53,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:37:53,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301171539] [2022-04-08 01:37:53,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:37:53,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:37:53,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:37:53,660 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:37:53,661 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:37:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:53,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 01:37:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:53,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:37:53,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {1465#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:53,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {1465#true} is VALID [2022-04-08 01:37:53,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:53,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1465#true} {1465#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:53,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {1465#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:53,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {1465#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1465#true} is VALID [2022-04-08 01:37:53,929 INFO L272 TraceCheckUtils]: 6: Hoare triple {1465#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {1465#true} is VALID [2022-04-08 01:37:53,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#true} [105] 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] {1465#true} is VALID [2022-04-08 01:37:53,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#true} [110] 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[] {1465#true} is VALID [2022-04-08 01:37:53,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:53,929 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1465#true} {1465#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {1465#true} is VALID [2022-04-08 01:37:53,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {1503#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:53,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {1503#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:53,930 INFO L272 TraceCheckUtils]: 13: Hoare triple {1503#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {1465#true} is VALID [2022-04-08 01:37:53,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#true} [119] __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] {1465#true} is VALID [2022-04-08 01:37:53,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#true} [124] 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[] {1465#true} is VALID [2022-04-08 01:37:53,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:53,931 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1465#true} {1503#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1503#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:53,931 INFO L272 TraceCheckUtils]: 18: Hoare triple {1503#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {1465#true} is VALID [2022-04-08 01:37:53,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {1465#true} [119] __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] {1465#true} is VALID [2022-04-08 01:37:53,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {1465#true} [124] 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[] {1465#true} is VALID [2022-04-08 01:37:53,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {1465#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:53,933 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1465#true} {1503#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1503#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:53,933 INFO L272 TraceCheckUtils]: 23: Hoare triple {1503#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {1465#true} is VALID [2022-04-08 01:37:53,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#true} [119] __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] {1465#true} is VALID [2022-04-08 01:37:53,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {1465#true} [124] 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[] {1465#true} is VALID [2022-04-08 01:37:53,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {1465#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:53,934 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1465#true} {1503#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1503#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:53,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {1503#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1555#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 01:37:53,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {1555#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 01:37:53,938 INFO L272 TraceCheckUtils]: 30: Hoare triple {1555#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {1465#true} is VALID [2022-04-08 01:37:53,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {1465#true} [119] __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] {1465#true} is VALID [2022-04-08 01:37:53,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {1465#true} [124] 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[] {1465#true} is VALID [2022-04-08 01:37:53,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {1465#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:53,944 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1465#true} {1555#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {1555#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 01:37:53,945 INFO L272 TraceCheckUtils]: 35: Hoare triple {1555#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {1465#true} is VALID [2022-04-08 01:37:53,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {1465#true} [119] __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] {1465#true} is VALID [2022-04-08 01:37:53,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {1465#true} [124] 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[] {1465#true} is VALID [2022-04-08 01:37:53,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {1465#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:53,946 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1465#true} {1555#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {1555#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 01:37:53,946 INFO L272 TraceCheckUtils]: 40: Hoare triple {1555#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:37:53,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {1596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:37:53,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {1596#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {1466#false} is VALID [2022-04-08 01:37:53,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {1466#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#false} is VALID [2022-04-08 01:37:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 01:37:53,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 01:37:54,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {1466#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#false} is VALID [2022-04-08 01:37:54,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {1596#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {1466#false} is VALID [2022-04-08 01:37:54,205 INFO L290 TraceCheckUtils]: 41: Hoare triple {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {1596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:37:54,206 INFO L272 TraceCheckUtils]: 40: Hoare triple {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:37:54,206 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1465#true} {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 01:37:54,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {1465#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:54,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {1465#true} [124] 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[] {1465#true} is VALID [2022-04-08 01:37:54,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {1465#true} [119] __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] {1465#true} is VALID [2022-04-08 01:37:54,207 INFO L272 TraceCheckUtils]: 35: Hoare triple {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {1465#true} is VALID [2022-04-08 01:37:54,207 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1465#true} {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 01:37:54,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {1465#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:54,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {1465#true} [124] 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[] {1465#true} is VALID [2022-04-08 01:37:54,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {1465#true} [119] __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] {1465#true} is VALID [2022-04-08 01:37:54,208 INFO L272 TraceCheckUtils]: 30: Hoare triple {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {1465#true} is VALID [2022-04-08 01:37:54,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 01:37:54,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 01:37:54,209 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1465#true} {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 01:37:54,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {1465#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:54,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {1465#true} [124] 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[] {1465#true} is VALID [2022-04-08 01:37:54,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#true} [119] __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] {1465#true} is VALID [2022-04-08 01:37:54,210 INFO L272 TraceCheckUtils]: 23: Hoare triple {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {1465#true} is VALID [2022-04-08 01:37:54,210 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1465#true} {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 01:37:54,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {1465#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:54,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {1465#true} [124] 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[] {1465#true} is VALID [2022-04-08 01:37:54,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {1465#true} [119] __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] {1465#true} is VALID [2022-04-08 01:37:54,211 INFO L272 TraceCheckUtils]: 18: Hoare triple {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {1465#true} is VALID [2022-04-08 01:37:54,211 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1465#true} {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 01:37:54,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:54,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#true} [124] 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[] {1465#true} is VALID [2022-04-08 01:37:54,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#true} [119] __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] {1465#true} is VALID [2022-04-08 01:37:54,211 INFO L272 TraceCheckUtils]: 13: Hoare triple {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {1465#true} is VALID [2022-04-08 01:37:54,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 01:37:54,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {1612#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 01:37:54,212 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1465#true} {1465#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {1465#true} is VALID [2022-04-08 01:37:54,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:54,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#true} [110] 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[] {1465#true} is VALID [2022-04-08 01:37:54,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#true} [105] 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] {1465#true} is VALID [2022-04-08 01:37:54,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {1465#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {1465#true} is VALID [2022-04-08 01:37:54,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {1465#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1465#true} is VALID [2022-04-08 01:37:54,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {1465#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:54,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1465#true} {1465#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:54,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:54,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {1465#true} is VALID [2022-04-08 01:37:54,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {1465#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1465#true} is VALID [2022-04-08 01:37:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 01:37:54,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:37:54,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682427456] [2022-04-08 01:37:54,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:37:54,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301171539] [2022-04-08 01:37:54,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301171539] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 01:37:54,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 01:37:54,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 01:37:54,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582163707] [2022-04-08 01:37:54,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:37:54,215 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-08 01:37:54,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:37:54,215 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 01:37:54,231 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:37:54,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 01:37:54,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:37:54,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 01:37:54,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 01:37:54,232 INFO L87 Difference]: Start difference. First operand 57 states and 69 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 01:37:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:56,714 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-08 01:37:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 01:37:56,714 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-08 01:37:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:37:56,715 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 01:37:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 01:37:56,716 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 01:37:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 01:37:56,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-08 01:37:56,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:37:56,800 INFO L225 Difference]: With dead ends: 69 [2022-04-08 01:37:56,800 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 01:37:56,801 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 01:37:56,801 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 01:37:56,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 01:37:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 01:37:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-04-08 01:37:56,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:37:56,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 01:37:56,819 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 01:37:56,819 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 01:37:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:56,822 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2022-04-08 01:37:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-04-08 01:37:56,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:37:56,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:37:56,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-08 01:37:56,822 INFO L87 Difference]: Start difference. First operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-08 01:37:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:37:56,824 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2022-04-08 01:37:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-04-08 01:37:56,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:37:56,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:37:56,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:37:56,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:37:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 01:37:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-04-08 01:37:56,826 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 44 [2022-04-08 01:37:56,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:37:56,827 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-04-08 01:37:56,827 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 01:37:56,827 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 01:37:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 01:37:56,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:37:56,828 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:37:56,857 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:37:57,052 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:37:57,053 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:37:57,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:37:57,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1382136022, now seen corresponding path program 1 times [2022-04-08 01:37:57,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:37:57,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871038534] [2022-04-08 01:37:57,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:37:57,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:37:57,108 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:37:57,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531094801] [2022-04-08 01:37:57,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:37:57,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:37:57,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:37:57,115 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:37:57,116 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:37:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:57,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 01:37:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:37:57,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:37:57,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {2064#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:57,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {2064#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {2064#true} is VALID [2022-04-08 01:37:57,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {2064#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:57,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2064#true} {2064#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:57,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {2064#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:57,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {2064#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2064#true} is VALID [2022-04-08 01:37:57,687 INFO L272 TraceCheckUtils]: 6: Hoare triple {2064#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {2064#true} is VALID [2022-04-08 01:37:57,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {2064#true} [105] 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] {2064#true} is VALID [2022-04-08 01:37:57,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {2064#true} [110] 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[] {2064#true} is VALID [2022-04-08 01:37:57,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {2064#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:57,688 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2064#true} {2064#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {2064#true} is VALID [2022-04-08 01:37:57,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {2064#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:57,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:57,689 INFO L272 TraceCheckUtils]: 13: Hoare triple {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {2064#true} is VALID [2022-04-08 01:37:57,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:57,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:57,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:57,694 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2064#true} {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:57,695 INFO L272 TraceCheckUtils]: 18: Hoare triple {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {2064#true} is VALID [2022-04-08 01:37:57,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:57,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:57,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:57,697 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2064#true} {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:57,697 INFO L272 TraceCheckUtils]: 23: Hoare triple {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {2064#true} is VALID [2022-04-08 01:37:57,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:57,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:57,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:57,698 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2064#true} {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:57,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:57,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:57,699 INFO L272 TraceCheckUtils]: 30: Hoare triple {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {2064#true} is VALID [2022-04-08 01:37:57,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:57,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:57,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:57,701 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2064#true} {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:57,701 INFO L272 TraceCheckUtils]: 35: Hoare triple {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {2064#true} is VALID [2022-04-08 01:37:57,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:57,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:57,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:57,702 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2064#true} {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:57,702 INFO L272 TraceCheckUtils]: 40: Hoare triple {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {2064#true} is VALID [2022-04-08 01:37:57,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:57,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:57,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:57,703 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2064#true} {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:57,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:57,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:57,704 INFO L272 TraceCheckUtils]: 47: Hoare triple {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {2064#true} is VALID [2022-04-08 01:37:57,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:57,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:57,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:57,704 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2064#true} {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:57,704 INFO L272 TraceCheckUtils]: 52: Hoare triple {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {2064#true} is VALID [2022-04-08 01:37:57,705 INFO L290 TraceCheckUtils]: 53: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:57,705 INFO L290 TraceCheckUtils]: 54: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:57,705 INFO L290 TraceCheckUtils]: 55: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:57,705 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2064#true} {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:37:57,706 INFO L290 TraceCheckUtils]: 57: Hoare triple {2154#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [127] L46-->L52: Formula: (and (= v_main_~p~0_5 (let ((.cse0 (div v_main_~p~0_6 2))) (ite (and (< v_main_~p~0_6 0) (not (= (mod v_main_~p~0_6 2) 0))) (+ .cse0 1) .cse0))) (= v_main_~d~0_4 (let ((.cse1 (div v_main_~d~0_5 2))) (ite (and (< v_main_~d~0_5 0) (not (= (mod v_main_~d~0_5 2) 0))) (+ .cse1 1) .cse1))) (not (= v_main_~p~0_6 1))) InVars {main_~p~0=v_main_~p~0_6, main_~d~0=v_main_~d~0_5} OutVars{main_~p~0=v_main_~p~0_5, main_~d~0=v_main_~d~0_4} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:37:57,706 INFO L290 TraceCheckUtils]: 58: Hoare triple {2102#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [134] L52-->L52-2: Formula: (and (<= v_main_~d~0_6 v_main_~r~0_5) (= (+ v_main_~p~0_7 v_main_~q~0_5) v_main_~q~0_4) (= v_main_~r~0_4 (+ v_main_~r~0_5 (* (- 1) v_main_~d~0_6)))) InVars {main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_4, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2245#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-08 01:37:57,707 INFO L290 TraceCheckUtils]: 59: Hoare triple {2245#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2245#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-08 01:37:57,707 INFO L272 TraceCheckUtils]: 60: Hoare triple {2245#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {2252#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:37:57,708 INFO L290 TraceCheckUtils]: 61: Hoare triple {2252#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {2256#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:37:57,708 INFO L290 TraceCheckUtils]: 62: Hoare triple {2256#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {2065#false} is VALID [2022-04-08 01:37:57,708 INFO L290 TraceCheckUtils]: 63: Hoare triple {2065#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2065#false} is VALID [2022-04-08 01:37:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 01:37:57,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 01:37:59,102 INFO L290 TraceCheckUtils]: 63: Hoare triple {2065#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2065#false} is VALID [2022-04-08 01:37:59,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {2256#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {2065#false} is VALID [2022-04-08 01:37:59,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {2252#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {2256#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:37:59,104 INFO L272 TraceCheckUtils]: 60: Hoare triple {2272#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {2252#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:37:59,105 INFO L290 TraceCheckUtils]: 59: Hoare triple {2272#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2272#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 01:37:59,123 INFO L290 TraceCheckUtils]: 58: Hoare triple {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [134] L52-->L52-2: Formula: (and (<= v_main_~d~0_6 v_main_~r~0_5) (= (+ v_main_~p~0_7 v_main_~q~0_5) v_main_~q~0_4) (= v_main_~r~0_4 (+ v_main_~r~0_5 (* (- 1) v_main_~d~0_6)))) InVars {main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_4, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2272#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 01:37:59,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [127] L46-->L52: Formula: (and (= v_main_~p~0_5 (let ((.cse0 (div v_main_~p~0_6 2))) (ite (and (< v_main_~p~0_6 0) (not (= (mod v_main_~p~0_6 2) 0))) (+ .cse0 1) .cse0))) (= v_main_~d~0_4 (let ((.cse1 (div v_main_~d~0_5 2))) (ite (and (< v_main_~d~0_5 0) (not (= (mod v_main_~d~0_5 2) 0))) (+ .cse1 1) .cse1))) (not (= v_main_~p~0_6 1))) InVars {main_~p~0=v_main_~p~0_6, main_~d~0=v_main_~d~0_5} OutVars{main_~p~0=v_main_~p~0_5, main_~d~0=v_main_~d~0_4} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 01:37:59,141 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2064#true} {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 01:37:59,141 INFO L290 TraceCheckUtils]: 55: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:59,141 INFO L290 TraceCheckUtils]: 54: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:59,141 INFO L290 TraceCheckUtils]: 53: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:59,142 INFO L272 TraceCheckUtils]: 52: Hoare triple {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {2064#true} is VALID [2022-04-08 01:37:59,142 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2064#true} {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 01:37:59,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:59,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:59,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:59,143 INFO L272 TraceCheckUtils]: 47: Hoare triple {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {2064#true} is VALID [2022-04-08 01:37:59,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 01:37:59,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 01:37:59,145 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2064#true} {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 01:37:59,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:59,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:59,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:59,146 INFO L272 TraceCheckUtils]: 40: Hoare triple {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {2064#true} is VALID [2022-04-08 01:37:59,146 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2064#true} {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 01:37:59,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:59,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:59,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:59,147 INFO L272 TraceCheckUtils]: 35: Hoare triple {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {2064#true} is VALID [2022-04-08 01:37:59,147 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2064#true} {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 01:37:59,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:59,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:59,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:59,147 INFO L272 TraceCheckUtils]: 30: Hoare triple {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {2064#true} is VALID [2022-04-08 01:37:59,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 01:37:59,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2283#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 01:37:59,155 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2064#true} {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 01:37:59,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:59,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:59,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:59,155 INFO L272 TraceCheckUtils]: 23: Hoare triple {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {2064#true} is VALID [2022-04-08 01:37:59,156 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2064#true} {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 01:37:59,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:59,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:59,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:59,156 INFO L272 TraceCheckUtils]: 18: Hoare triple {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {2064#true} is VALID [2022-04-08 01:37:59,157 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2064#true} {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 01:37:59,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {2064#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:59,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {2064#true} [124] 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[] {2064#true} is VALID [2022-04-08 01:37:59,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {2064#true} [119] __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] {2064#true} is VALID [2022-04-08 01:37:59,157 INFO L272 TraceCheckUtils]: 13: Hoare triple {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {2064#true} is VALID [2022-04-08 01:37:59,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 01:37:59,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {2064#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {2279#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 01:37:59,158 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2064#true} {2064#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {2064#true} is VALID [2022-04-08 01:37:59,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {2064#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:59,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {2064#true} [110] 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[] {2064#true} is VALID [2022-04-08 01:37:59,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {2064#true} [105] 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] {2064#true} is VALID [2022-04-08 01:37:59,158 INFO L272 TraceCheckUtils]: 6: Hoare triple {2064#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {2064#true} is VALID [2022-04-08 01:37:59,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {2064#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2064#true} is VALID [2022-04-08 01:37:59,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {2064#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:59,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2064#true} {2064#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:59,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {2064#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:59,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {2064#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {2064#true} is VALID [2022-04-08 01:37:59,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {2064#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2064#true} is VALID [2022-04-08 01:37:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 01:37:59,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:37:59,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871038534] [2022-04-08 01:37:59,159 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:37:59,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531094801] [2022-04-08 01:37:59,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531094801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 01:37:59,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 01:37:59,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-08 01:37:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016122257] [2022-04-08 01:37:59,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 01:37:59,160 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 64 [2022-04-08 01:37:59,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:37:59,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-08 01:37:59,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:37:59,247 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 01:37:59,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:37:59,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 01:37:59,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 01:37:59,247 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-08 01:38:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:38:02,147 INFO L93 Difference]: Finished difference Result 154 states and 210 transitions. [2022-04-08 01:38:02,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 01:38:02,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 64 [2022-04-08 01:38:02,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:38:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-08 01:38:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2022-04-08 01:38:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-08 01:38:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2022-04-08 01:38:02,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 141 transitions. [2022-04-08 01:38:02,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:38:02,370 INFO L225 Difference]: With dead ends: 154 [2022-04-08 01:38:02,370 INFO L226 Difference]: Without dead ends: 125 [2022-04-08 01:38:02,370 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-08 01:38:02,371 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 42 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 01:38:02,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 168 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 01:38:02,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-08 01:38:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2022-04-08 01:38:02,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:38:02,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 113 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 01:38:02,422 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 113 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 01:38:02,422 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 113 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 01:38:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:38:02,426 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2022-04-08 01:38:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2022-04-08 01:38:02,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:38:02,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:38:02,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 125 states. [2022-04-08 01:38:02,428 INFO L87 Difference]: Start difference. First operand has 113 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 125 states. [2022-04-08 01:38:02,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:38:02,466 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2022-04-08 01:38:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2022-04-08 01:38:02,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:38:02,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:38:02,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:38:02,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:38:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 01:38:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2022-04-08 01:38:02,472 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 64 [2022-04-08 01:38:02,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:38:02,472 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2022-04-08 01:38:02,472 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 7 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-08 01:38:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2022-04-08 01:38:02,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 01:38:02,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:38:02,476 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:38:02,509 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:38:02,692 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:38:02,693 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:38:02,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:38:02,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1085940318, now seen corresponding path program 1 times [2022-04-08 01:38:02,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:38:02,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39498213] [2022-04-08 01:38:02,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:38:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:38:02,717 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:38:02,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1271456219] [2022-04-08 01:38:02,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:38:02,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:38:02,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:38:02,724 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:38:02,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 01:38:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:38:02,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 01:38:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:38:02,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:38:03,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {3103#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:03,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {3103#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {3103#true} is VALID [2022-04-08 01:38:03,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {3103#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:03,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3103#true} {3103#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:03,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {3103#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:03,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {3103#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {3103#true} is VALID [2022-04-08 01:38:03,378 INFO L272 TraceCheckUtils]: 6: Hoare triple {3103#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {3103#true} is VALID [2022-04-08 01:38:03,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {3103#true} [105] 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] {3103#true} is VALID [2022-04-08 01:38:03,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {3103#true} [110] 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[] {3103#true} is VALID [2022-04-08 01:38:03,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {3103#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:03,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3103#true} {3103#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {3103#true} is VALID [2022-04-08 01:38:03,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {3103#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:38:03,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:38:03,383 INFO L272 TraceCheckUtils]: 13: Hoare triple {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {3103#true} is VALID [2022-04-08 01:38:03,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:03,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:03,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:03,388 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3103#true} {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:38:03,388 INFO L272 TraceCheckUtils]: 18: Hoare triple {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {3103#true} is VALID [2022-04-08 01:38:03,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:03,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:03,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:03,389 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3103#true} {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:38:03,389 INFO L272 TraceCheckUtils]: 23: Hoare triple {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {3103#true} is VALID [2022-04-08 01:38:03,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:03,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:03,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:03,390 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3103#true} {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:38:03,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:38:03,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:38:03,391 INFO L272 TraceCheckUtils]: 30: Hoare triple {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {3103#true} is VALID [2022-04-08 01:38:03,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:03,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:03,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:03,392 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3103#true} {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:38:03,392 INFO L272 TraceCheckUtils]: 35: Hoare triple {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {3103#true} is VALID [2022-04-08 01:38:03,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:03,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:03,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:03,392 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3103#true} {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:38:03,393 INFO L272 TraceCheckUtils]: 40: Hoare triple {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {3103#true} is VALID [2022-04-08 01:38:03,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:03,393 INFO L290 TraceCheckUtils]: 42: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:03,393 INFO L290 TraceCheckUtils]: 43: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:03,393 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3103#true} {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:38:03,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:38:03,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:38:03,394 INFO L272 TraceCheckUtils]: 47: Hoare triple {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {3103#true} is VALID [2022-04-08 01:38:03,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:03,394 INFO L290 TraceCheckUtils]: 49: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:03,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:03,395 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3103#true} {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:38:03,395 INFO L272 TraceCheckUtils]: 52: Hoare triple {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {3103#true} is VALID [2022-04-08 01:38:03,395 INFO L290 TraceCheckUtils]: 53: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:03,395 INFO L290 TraceCheckUtils]: 54: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:03,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:03,396 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3103#true} {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 01:38:03,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {3193#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} [127] L46-->L52: Formula: (and (= v_main_~p~0_5 (let ((.cse0 (div v_main_~p~0_6 2))) (ite (and (< v_main_~p~0_6 0) (not (= (mod v_main_~p~0_6 2) 0))) (+ .cse0 1) .cse0))) (= v_main_~d~0_4 (let ((.cse1 (div v_main_~d~0_5 2))) (ite (and (< v_main_~d~0_5 0) (not (= (mod v_main_~d~0_5 2) 0))) (+ .cse1 1) .cse1))) (not (= v_main_~p~0_6 1))) InVars {main_~p~0=v_main_~p~0_6, main_~d~0=v_main_~d~0_5} OutVars{main_~p~0=v_main_~p~0_5, main_~d~0=v_main_~d~0_4} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:38:03,397 INFO L290 TraceCheckUtils]: 58: Hoare triple {3141#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [134] L52-->L52-2: Formula: (and (<= v_main_~d~0_6 v_main_~r~0_5) (= (+ v_main_~p~0_7 v_main_~q~0_5) v_main_~q~0_4) (= v_main_~r~0_4 (+ v_main_~r~0_5 (* (- 1) v_main_~d~0_6)))) InVars {main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_4, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {3284#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:38:03,397 INFO L290 TraceCheckUtils]: 59: Hoare triple {3284#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:38:03,397 INFO L272 TraceCheckUtils]: 60: Hoare triple {3284#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {3103#true} is VALID [2022-04-08 01:38:03,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {3103#true} [119] __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] {3294#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:38:03,398 INFO L290 TraceCheckUtils]: 62: Hoare triple {3294#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [124] 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[] {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:38:03,398 INFO L290 TraceCheckUtils]: 63: Hoare triple {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:38:03,399 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} {3284#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {3284#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:38:03,399 INFO L272 TraceCheckUtils]: 65: Hoare triple {3284#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {3103#true} is VALID [2022-04-08 01:38:03,399 INFO L290 TraceCheckUtils]: 66: Hoare triple {3103#true} [119] __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] {3294#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:38:03,399 INFO L290 TraceCheckUtils]: 67: Hoare triple {3294#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [124] 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[] {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:38:03,400 INFO L290 TraceCheckUtils]: 68: Hoare triple {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:38:03,400 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} {3284#(and (= main_~q~0 main_~p~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {3320#(and (= main_~q~0 main_~p~0) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} is VALID [2022-04-08 01:38:03,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {3320#(and (= main_~q~0 main_~p~0) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} [126] L46-->L44-1: Formula: (= v_main_~p~0_4 1) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_4} AuxVars[] AssignedVars[] {3324#(and (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~q~0 1))} is VALID [2022-04-08 01:38:03,401 INFO L272 TraceCheckUtils]: 71: Hoare triple {3324#(and (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~q~0 1))} [116] L44-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_12 (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13)) 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] {3328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:38:03,402 INFO L290 TraceCheckUtils]: 72: Hoare triple {3328#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {3332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:38:03,402 INFO L290 TraceCheckUtils]: 73: Hoare triple {3332#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {3104#false} is VALID [2022-04-08 01:38:03,402 INFO L290 TraceCheckUtils]: 74: Hoare triple {3104#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3104#false} is VALID [2022-04-08 01:38:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 66 proven. 11 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-08 01:38:03,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 01:38:15,671 INFO L290 TraceCheckUtils]: 74: Hoare triple {3104#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3104#false} is VALID [2022-04-08 01:38:15,671 INFO L290 TraceCheckUtils]: 73: Hoare triple {3332#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {3104#false} is VALID [2022-04-08 01:38:15,672 INFO L290 TraceCheckUtils]: 72: Hoare triple {3328#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {3332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:38:15,673 INFO L272 TraceCheckUtils]: 71: Hoare triple {3348#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} [116] L44-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_12 (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13)) 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] {3328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:38:15,673 INFO L290 TraceCheckUtils]: 70: Hoare triple {3352#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} [126] L46-->L44-1: Formula: (= v_main_~p~0_4 1) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_4} AuxVars[] AssignedVars[] {3348#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 01:38:15,674 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} {3356#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {3352#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-08 01:38:15,674 INFO L290 TraceCheckUtils]: 68: Hoare triple {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:38:15,675 INFO L290 TraceCheckUtils]: 67: Hoare triple {3366#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [124] 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[] {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:38:15,675 INFO L290 TraceCheckUtils]: 66: Hoare triple {3103#true} [119] __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] {3366#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 01:38:15,675 INFO L272 TraceCheckUtils]: 65: Hoare triple {3356#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {3103#true} is VALID [2022-04-08 01:38:15,677 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} {3103#true} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {3356#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} is VALID [2022-04-08 01:38:15,677 INFO L290 TraceCheckUtils]: 63: Hoare triple {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:38:15,677 INFO L290 TraceCheckUtils]: 62: Hoare triple {3366#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [124] 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[] {3298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:38:15,678 INFO L290 TraceCheckUtils]: 61: Hoare triple {3103#true} [119] __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] {3366#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 01:38:15,678 INFO L272 TraceCheckUtils]: 60: Hoare triple {3103#true} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {3103#true} is VALID [2022-04-08 01:38:15,678 INFO L290 TraceCheckUtils]: 59: Hoare triple {3103#true} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,678 INFO L290 TraceCheckUtils]: 58: Hoare triple {3103#true} [134] L52-->L52-2: Formula: (and (<= v_main_~d~0_6 v_main_~r~0_5) (= (+ v_main_~p~0_7 v_main_~q~0_5) v_main_~q~0_4) (= v_main_~r~0_4 (+ v_main_~r~0_5 (* (- 1) v_main_~d~0_6)))) InVars {main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_4, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {3103#true} is VALID [2022-04-08 01:38:15,678 INFO L290 TraceCheckUtils]: 57: Hoare triple {3103#true} [127] L46-->L52: Formula: (and (= v_main_~p~0_5 (let ((.cse0 (div v_main_~p~0_6 2))) (ite (and (< v_main_~p~0_6 0) (not (= (mod v_main_~p~0_6 2) 0))) (+ .cse0 1) .cse0))) (= v_main_~d~0_4 (let ((.cse1 (div v_main_~d~0_5 2))) (ite (and (< v_main_~d~0_5 0) (not (= (mod v_main_~d~0_5 2) 0))) (+ .cse1 1) .cse1))) (not (= v_main_~p~0_6 1))) InVars {main_~p~0=v_main_~p~0_6, main_~d~0=v_main_~d~0_5} OutVars{main_~p~0=v_main_~p~0_5, main_~d~0=v_main_~d~0_4} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {3103#true} is VALID [2022-04-08 01:38:15,678 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3103#true} {3103#true} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {3103#true} is VALID [2022-04-08 01:38:15,678 INFO L290 TraceCheckUtils]: 55: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:15,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:15,678 INFO L272 TraceCheckUtils]: 52: Hoare triple {3103#true} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3103#true} {3103#true} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L290 TraceCheckUtils]: 50: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L290 TraceCheckUtils]: 49: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L290 TraceCheckUtils]: 48: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L272 TraceCheckUtils]: 47: Hoare triple {3103#true} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {3103#true} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {3103#true} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3103#true} {3103#true} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L290 TraceCheckUtils]: 43: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L272 TraceCheckUtils]: 40: Hoare triple {3103#true} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3103#true} {3103#true} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:15,679 INFO L272 TraceCheckUtils]: 35: Hoare triple {3103#true} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3103#true} {3103#true} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L272 TraceCheckUtils]: 30: Hoare triple {3103#true} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {3103#true} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {3103#true} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3103#true} {3103#true} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L272 TraceCheckUtils]: 23: Hoare triple {3103#true} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3103#true} {3103#true} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:15,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L272 TraceCheckUtils]: 18: Hoare triple {3103#true} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3103#true} {3103#true} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {3103#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {3103#true} [124] 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[] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {3103#true} [119] __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] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L272 TraceCheckUtils]: 13: Hoare triple {3103#true} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {3103#true} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {3103#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3103#true} {3103#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {3103#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {3103#true} [110] 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[] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {3103#true} [105] 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] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L272 TraceCheckUtils]: 6: Hoare triple {3103#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {3103#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {3103#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3103#true} {3103#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {3103#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {3103#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {3103#true} is VALID [2022-04-08 01:38:15,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {3103#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#true} is VALID [2022-04-08 01:38:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-04-08 01:38:15,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:38:15,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39498213] [2022-04-08 01:38:15,682 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:38:15,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271456219] [2022-04-08 01:38:15,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271456219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 01:38:15,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 01:38:15,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-04-08 01:38:15,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317724334] [2022-04-08 01:38:15,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 01:38:15,683 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) Word has length 75 [2022-04-08 01:38:15,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:38:15,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-08 01:38:15,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:38:15,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 01:38:15,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:38:15,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 01:38:15,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-08 01:38:15,742 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-08 01:38:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:38:16,981 INFO L93 Difference]: Finished difference Result 169 states and 219 transitions. [2022-04-08 01:38:16,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 01:38:16,982 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) Word has length 75 [2022-04-08 01:38:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:38:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-08 01:38:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 114 transitions. [2022-04-08 01:38:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-08 01:38:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 114 transitions. [2022-04-08 01:38:16,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 114 transitions. [2022-04-08 01:38:17,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:38:17,086 INFO L225 Difference]: With dead ends: 169 [2022-04-08 01:38:17,086 INFO L226 Difference]: Without dead ends: 115 [2022-04-08 01:38:17,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-04-08 01:38:17,087 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 01:38:17,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 146 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 01:38:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-08 01:38:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2022-04-08 01:38:17,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:38:17,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 101 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 01:38:17,149 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 101 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 01:38:17,152 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 101 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 01:38:17,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:38:17,158 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-04-08 01:38:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2022-04-08 01:38:17,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:38:17,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:38:17,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 115 states. [2022-04-08 01:38:17,159 INFO L87 Difference]: Start difference. First operand has 101 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 115 states. [2022-04-08 01:38:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:38:17,161 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-04-08 01:38:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2022-04-08 01:38:17,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:38:17,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:38:17,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:38:17,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:38:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 01:38:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2022-04-08 01:38:17,167 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 75 [2022-04-08 01:38:17,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:38:17,167 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2022-04-08 01:38:17,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-08 01:38:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-04-08 01:38:17,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 01:38:17,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:38:17,168 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:38:17,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 01:38:17,385 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:38:17,385 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:38:17,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:38:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1480109990, now seen corresponding path program 1 times [2022-04-08 01:38:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:38:17,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525869386] [2022-04-08 01:38:17,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:38:17,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:38:17,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:38:17,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1467343882] [2022-04-08 01:38:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:38:17,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:38:17,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:38:17,397 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 01:38:17,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 01:38:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:38:17,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 01:38:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:38:17,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:38:18,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {4187#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {4187#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {4187#true} is VALID [2022-04-08 01:38:18,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {4187#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4187#true} {4187#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {4187#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {4187#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {4187#true} is VALID [2022-04-08 01:38:18,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {4187#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {4187#true} is VALID [2022-04-08 01:38:18,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {4187#true} [105] 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] {4187#true} is VALID [2022-04-08 01:38:18,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {4187#true} [110] 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[] {4187#true} is VALID [2022-04-08 01:38:18,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {4187#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,657 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4187#true} {4187#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {4187#true} is VALID [2022-04-08 01:38:18,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {4187#true} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {4225#(<= 1 main_~p~0)} is VALID [2022-04-08 01:38:18,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {4225#(<= 1 main_~p~0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4225#(<= 1 main_~p~0)} is VALID [2022-04-08 01:38:18,658 INFO L272 TraceCheckUtils]: 13: Hoare triple {4225#(<= 1 main_~p~0)} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {4187#true} is VALID [2022-04-08 01:38:18,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {4187#true} [119] __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] {4187#true} is VALID [2022-04-08 01:38:18,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {4187#true} [124] 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[] {4187#true} is VALID [2022-04-08 01:38:18,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {4187#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,659 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4187#true} {4225#(<= 1 main_~p~0)} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {4225#(<= 1 main_~p~0)} is VALID [2022-04-08 01:38:18,659 INFO L272 TraceCheckUtils]: 18: Hoare triple {4225#(<= 1 main_~p~0)} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {4187#true} is VALID [2022-04-08 01:38:18,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {4187#true} [119] __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] {4187#true} is VALID [2022-04-08 01:38:18,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {4187#true} [124] 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[] {4187#true} is VALID [2022-04-08 01:38:18,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {4187#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,660 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4187#true} {4225#(<= 1 main_~p~0)} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {4225#(<= 1 main_~p~0)} is VALID [2022-04-08 01:38:18,660 INFO L272 TraceCheckUtils]: 23: Hoare triple {4225#(<= 1 main_~p~0)} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {4187#true} is VALID [2022-04-08 01:38:18,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {4187#true} [119] __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] {4187#true} is VALID [2022-04-08 01:38:18,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {4187#true} [124] 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[] {4187#true} is VALID [2022-04-08 01:38:18,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {4187#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,660 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4187#true} {4225#(<= 1 main_~p~0)} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {4225#(<= 1 main_~p~0)} is VALID [2022-04-08 01:38:18,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {4225#(<= 1 main_~p~0)} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {4277#(<= 1 (div main_~p~0 2))} is VALID [2022-04-08 01:38:18,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {4277#(<= 1 (div main_~p~0 2))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4277#(<= 1 (div main_~p~0 2))} is VALID [2022-04-08 01:38:18,661 INFO L272 TraceCheckUtils]: 30: Hoare triple {4277#(<= 1 (div main_~p~0 2))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {4187#true} is VALID [2022-04-08 01:38:18,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {4187#true} [119] __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] {4187#true} is VALID [2022-04-08 01:38:18,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {4187#true} [124] 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[] {4187#true} is VALID [2022-04-08 01:38:18,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {4187#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,662 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4187#true} {4277#(<= 1 (div main_~p~0 2))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {4277#(<= 1 (div main_~p~0 2))} is VALID [2022-04-08 01:38:18,662 INFO L272 TraceCheckUtils]: 35: Hoare triple {4277#(<= 1 (div main_~p~0 2))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {4187#true} is VALID [2022-04-08 01:38:18,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {4187#true} [119] __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] {4187#true} is VALID [2022-04-08 01:38:18,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {4187#true} [124] 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[] {4187#true} is VALID [2022-04-08 01:38:18,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {4187#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,662 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4187#true} {4277#(<= 1 (div main_~p~0 2))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {4277#(<= 1 (div main_~p~0 2))} is VALID [2022-04-08 01:38:18,662 INFO L272 TraceCheckUtils]: 40: Hoare triple {4277#(<= 1 (div main_~p~0 2))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {4187#true} is VALID [2022-04-08 01:38:18,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {4187#true} [119] __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] {4187#true} is VALID [2022-04-08 01:38:18,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {4187#true} [124] 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[] {4187#true} is VALID [2022-04-08 01:38:18,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {4187#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,663 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4187#true} {4277#(<= 1 (div main_~p~0 2))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {4277#(<= 1 (div main_~p~0 2))} is VALID [2022-04-08 01:38:18,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {4277#(<= 1 (div main_~p~0 2))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {4329#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-08 01:38:18,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {4329#(<= 1 (div (div main_~p~0 2) 2))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4329#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-08 01:38:18,664 INFO L272 TraceCheckUtils]: 47: Hoare triple {4329#(<= 1 (div (div main_~p~0 2) 2))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {4187#true} is VALID [2022-04-08 01:38:18,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {4187#true} [119] __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] {4187#true} is VALID [2022-04-08 01:38:18,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {4187#true} [124] 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[] {4187#true} is VALID [2022-04-08 01:38:18,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {4187#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,664 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4187#true} {4329#(<= 1 (div (div main_~p~0 2) 2))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {4329#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-08 01:38:18,664 INFO L272 TraceCheckUtils]: 52: Hoare triple {4329#(<= 1 (div (div main_~p~0 2) 2))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {4187#true} is VALID [2022-04-08 01:38:18,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {4187#true} [119] __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] {4187#true} is VALID [2022-04-08 01:38:18,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {4187#true} [124] 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[] {4187#true} is VALID [2022-04-08 01:38:18,664 INFO L290 TraceCheckUtils]: 55: Hoare triple {4187#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,665 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4187#true} {4329#(<= 1 (div (div main_~p~0 2) 2))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {4329#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-08 01:38:18,665 INFO L272 TraceCheckUtils]: 57: Hoare triple {4329#(<= 1 (div (div main_~p~0 2) 2))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {4187#true} is VALID [2022-04-08 01:38:18,665 INFO L290 TraceCheckUtils]: 58: Hoare triple {4187#true} [119] __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] {4187#true} is VALID [2022-04-08 01:38:18,665 INFO L290 TraceCheckUtils]: 59: Hoare triple {4187#true} [124] 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[] {4187#true} is VALID [2022-04-08 01:38:18,665 INFO L290 TraceCheckUtils]: 60: Hoare triple {4187#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,665 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4187#true} {4329#(<= 1 (div (div main_~p~0 2) 2))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {4329#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-08 01:38:18,665 INFO L290 TraceCheckUtils]: 62: Hoare triple {4329#(<= 1 (div (div main_~p~0 2) 2))} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {4329#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-08 01:38:18,666 INFO L290 TraceCheckUtils]: 63: Hoare triple {4329#(<= 1 (div (div main_~p~0 2) 2))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4329#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-08 01:38:18,666 INFO L272 TraceCheckUtils]: 64: Hoare triple {4329#(<= 1 (div (div main_~p~0 2) 2))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {4187#true} is VALID [2022-04-08 01:38:18,666 INFO L290 TraceCheckUtils]: 65: Hoare triple {4187#true} [119] __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] {4187#true} is VALID [2022-04-08 01:38:18,666 INFO L290 TraceCheckUtils]: 66: Hoare triple {4187#true} [124] 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[] {4187#true} is VALID [2022-04-08 01:38:18,666 INFO L290 TraceCheckUtils]: 67: Hoare triple {4187#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,666 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4187#true} {4329#(<= 1 (div (div main_~p~0 2) 2))} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {4329#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-08 01:38:18,666 INFO L272 TraceCheckUtils]: 69: Hoare triple {4329#(<= 1 (div (div main_~p~0 2) 2))} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {4187#true} is VALID [2022-04-08 01:38:18,666 INFO L290 TraceCheckUtils]: 70: Hoare triple {4187#true} [119] __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] {4187#true} is VALID [2022-04-08 01:38:18,666 INFO L290 TraceCheckUtils]: 71: Hoare triple {4187#true} [124] 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[] {4187#true} is VALID [2022-04-08 01:38:18,666 INFO L290 TraceCheckUtils]: 72: Hoare triple {4187#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4187#true} is VALID [2022-04-08 01:38:18,667 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4187#true} {4329#(<= 1 (div (div main_~p~0 2) 2))} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {4329#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-08 01:38:18,667 INFO L290 TraceCheckUtils]: 74: Hoare triple {4329#(<= 1 (div (div main_~p~0 2) 2))} [126] L46-->L44-1: Formula: (= v_main_~p~0_4 1) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_4} AuxVars[] AssignedVars[] {4188#false} is VALID [2022-04-08 01:38:18,667 INFO L272 TraceCheckUtils]: 75: Hoare triple {4188#false} [116] L44-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_12 (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13)) 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] {4188#false} is VALID [2022-04-08 01:38:18,667 INFO L290 TraceCheckUtils]: 76: Hoare triple {4188#false} [119] __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] {4188#false} is VALID [2022-04-08 01:38:18,667 INFO L290 TraceCheckUtils]: 77: Hoare triple {4188#false} [124] 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[] {4188#false} is VALID [2022-04-08 01:38:18,667 INFO L290 TraceCheckUtils]: 78: Hoare triple {4188#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4188#false} is VALID [2022-04-08 01:38:18,667 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {4188#false} {4188#false} [143] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_12 (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13)) 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] {4188#false} is VALID [2022-04-08 01:38:18,667 INFO L272 TraceCheckUtils]: 80: Hoare triple {4188#false} [120] L58-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (= v_main_~B~0_10 v_main_~d~0_17) 1 0)) InVars {main_~d~0=v_main_~d~0_17, main_~B~0=v_main_~B~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0] {4188#false} is VALID [2022-04-08 01:38:18,667 INFO L290 TraceCheckUtils]: 81: Hoare triple {4188#false} [119] __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] {4188#false} is VALID [2022-04-08 01:38:18,668 INFO L290 TraceCheckUtils]: 82: Hoare triple {4188#false} [123] 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[] {4188#false} is VALID [2022-04-08 01:38:18,668 INFO L290 TraceCheckUtils]: 83: Hoare triple {4188#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4188#false} is VALID [2022-04-08 01:38:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-04-08 01:38:18,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 01:38:18,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:38:18,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525869386] [2022-04-08 01:38:18,668 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:38:18,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467343882] [2022-04-08 01:38:18,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467343882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:38:18,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:38:18,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 01:38:18,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841394285] [2022-04-08 01:38:18,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:38:18,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 84 [2022-04-08 01:38:18,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:38:18,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 01:38:18,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:38:18,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 01:38:18,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:38:18,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 01:38:18,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-08 01:38:18,709 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 01:38:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:38:18,985 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2022-04-08 01:38:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 01:38:18,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 84 [2022-04-08 01:38:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:38:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 01:38:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-08 01:38:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 01:38:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-08 01:38:18,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-08 01:38:19,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:38:19,056 INFO L225 Difference]: With dead ends: 115 [2022-04-08 01:38:19,056 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 01:38:19,057 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-08 01:38:19,057 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 9 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 01:38:19,057 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 106 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 01:38:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 01:38:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-08 01:38:19,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:38:19,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 01:38:19,132 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 01:38:19,133 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 01:38:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:38:19,146 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-08 01:38:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-08 01:38:19,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:38:19,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:38:19,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 103 states. [2022-04-08 01:38:19,147 INFO L87 Difference]: Start difference. First operand has 103 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 103 states. [2022-04-08 01:38:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:38:19,149 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-08 01:38:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-08 01:38:19,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:38:19,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:38:19,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:38:19,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:38:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 01:38:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2022-04-08 01:38:19,152 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 84 [2022-04-08 01:38:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:38:19,152 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2022-04-08 01:38:19,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 01:38:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-08 01:38:19,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-08 01:38:19,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:38:19,153 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:38:19,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 01:38:19,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:38:19,382 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:38:19,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:38:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash -233495842, now seen corresponding path program 2 times [2022-04-08 01:38:19,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:38:19,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011048770] [2022-04-08 01:38:19,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:38:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:38:19,425 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:38:19,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [383147423] [2022-04-08 01:38:19,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 01:38:19,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:38:19,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:38:19,432 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 01:38:19,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 01:38:19,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 01:38:19,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 01:38:19,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 01:38:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:38:19,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:38:20,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {4957#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4957#true} is VALID [2022-04-08 01:38:20,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {4957#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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| 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] {4957#true} is VALID [2022-04-08 01:38:20,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {4957#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4957#true} is VALID [2022-04-08 01:38:20,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4957#true} {4957#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4957#true} is VALID [2022-04-08 01:38:20,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {4957#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4957#true} is VALID [2022-04-08 01:38:20,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {4957#true} [101] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {4957#true} is VALID [2022-04-08 01:38:20,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {4957#true} [103] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {4957#true} is VALID [2022-04-08 01:38:20,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {4957#true} [105] 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] {4983#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 01:38:20,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {4983#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [110] 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[] {4987#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 01:38:20,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {4987#(not (= |assume_abort_if_not_#in~cond| 0))} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4987#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 01:38:20,191 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4987#(not (= |assume_abort_if_not_#in~cond| 0))} {4957#true} [137] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~A~0_9 1) (<= 0 v_main_~A~0_9)) 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] {4994#(and (<= 0 main_~A~0) (<= main_~A~0 1))} is VALID [2022-04-08 01:38:20,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {4994#(and (<= 0 main_~A~0) (<= main_~A~0 1))} [104] L26-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3) (= v_main_~B~0_4 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_4, main_~A~0=v_main_~A~0_6, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~B~0, main_~p~0, main_~r~0] {4998#(and (<= main_~r~0 1) (<= 1 main_~d~0))} is VALID [2022-04-08 01:38:20,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {4998#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4998#(and (<= main_~r~0 1) (<= 1 main_~d~0))} is VALID [2022-04-08 01:38:20,191 INFO L272 TraceCheckUtils]: 13: Hoare triple {4998#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {4957#true} is VALID [2022-04-08 01:38:20,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {4957#true} [119] __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] {4957#true} is VALID [2022-04-08 01:38:20,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {4957#true} [124] 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[] {4957#true} is VALID [2022-04-08 01:38:20,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {4957#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4957#true} is VALID [2022-04-08 01:38:20,192 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4957#true} {4998#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {4998#(and (<= main_~r~0 1) (<= 1 main_~d~0))} is VALID [2022-04-08 01:38:20,192 INFO L272 TraceCheckUtils]: 18: Hoare triple {4998#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {4957#true} is VALID [2022-04-08 01:38:20,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {4957#true} [119] __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] {4957#true} is VALID [2022-04-08 01:38:20,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {4957#true} [124] 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[] {4957#true} is VALID [2022-04-08 01:38:20,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {4957#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4957#true} is VALID [2022-04-08 01:38:20,193 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4957#true} {4998#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {4998#(and (<= main_~r~0 1) (<= 1 main_~d~0))} is VALID [2022-04-08 01:38:20,193 INFO L272 TraceCheckUtils]: 23: Hoare triple {4998#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {4957#true} is VALID [2022-04-08 01:38:20,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {4957#true} [119] __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] {4957#true} is VALID [2022-04-08 01:38:20,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {4957#true} [124] 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[] {4957#true} is VALID [2022-04-08 01:38:20,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {4957#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4957#true} is VALID [2022-04-08 01:38:20,193 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4957#true} {4998#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {4998#(and (<= main_~r~0 1) (<= 1 main_~d~0))} is VALID [2022-04-08 01:38:20,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {4998#(and (<= main_~r~0 1) (<= 1 main_~d~0))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {5050#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} is VALID [2022-04-08 01:38:20,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {5050#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5050#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} is VALID [2022-04-08 01:38:20,194 INFO L272 TraceCheckUtils]: 30: Hoare triple {5050#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {4957#true} is VALID [2022-04-08 01:38:20,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {4957#true} [119] __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] {4957#true} is VALID [2022-04-08 01:38:20,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {4957#true} [124] 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[] {4957#true} is VALID [2022-04-08 01:38:20,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {4957#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4957#true} is VALID [2022-04-08 01:38:20,195 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4957#true} {5050#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {5050#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} is VALID [2022-04-08 01:38:20,195 INFO L272 TraceCheckUtils]: 35: Hoare triple {5050#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {4957#true} is VALID [2022-04-08 01:38:20,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {4957#true} [119] __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] {4957#true} is VALID [2022-04-08 01:38:20,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {4957#true} [124] 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[] {4957#true} is VALID [2022-04-08 01:38:20,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {4957#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4957#true} is VALID [2022-04-08 01:38:20,196 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4957#true} {5050#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {5050#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} is VALID [2022-04-08 01:38:20,196 INFO L272 TraceCheckUtils]: 40: Hoare triple {5050#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {4957#true} is VALID [2022-04-08 01:38:20,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {4957#true} [119] __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] {4957#true} is VALID [2022-04-08 01:38:20,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {4957#true} [124] 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[] {4957#true} is VALID [2022-04-08 01:38:20,196 INFO L290 TraceCheckUtils]: 43: Hoare triple {4957#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4957#true} is VALID [2022-04-08 01:38:20,196 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4957#true} {5050#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {5050#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} is VALID [2022-04-08 01:38:20,197 INFO L290 TraceCheckUtils]: 45: Hoare triple {5050#(and (<= 1 (div main_~d~0 2)) (<= main_~r~0 1))} [129] L37-->L34-2: Formula: (and (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12) (<= v_main_~d~0_13 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {4958#false} is VALID [2022-04-08 01:38:20,197 INFO L290 TraceCheckUtils]: 46: Hoare triple {4958#false} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4958#false} is VALID [2022-04-08 01:38:20,197 INFO L272 TraceCheckUtils]: 47: Hoare triple {4958#false} [114] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {4958#false} is VALID [2022-04-08 01:38:20,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {4958#false} [119] __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] {4958#false} is VALID [2022-04-08 01:38:20,197 INFO L290 TraceCheckUtils]: 49: Hoare triple {4958#false} [124] 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[] {4958#false} is VALID [2022-04-08 01:38:20,197 INFO L290 TraceCheckUtils]: 50: Hoare triple {4958#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4958#false} is VALID [2022-04-08 01:38:20,197 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4958#false} {4958#false} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) 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] {4958#false} is VALID [2022-04-08 01:38:20,197 INFO L272 TraceCheckUtils]: 52: Hoare triple {4958#false} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {4958#false} is VALID [2022-04-08 01:38:20,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {4958#false} [119] __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] {4958#false} is VALID [2022-04-08 01:38:20,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {4958#false} [124] 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[] {4958#false} is VALID [2022-04-08 01:38:20,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {4958#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4958#false} is VALID [2022-04-08 01:38:20,197 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4958#false} {4958#false} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 v_main_~A~0_10) 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] {4958#false} is VALID [2022-04-08 01:38:20,197 INFO L272 TraceCheckUtils]: 57: Hoare triple {4958#false} [122] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {4958#false} is VALID [2022-04-08 01:38:20,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {4958#false} [119] __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] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L290 TraceCheckUtils]: 59: Hoare triple {4958#false} [124] 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[] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {4958#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4958#false} {4958#false} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_11 v_main_~B~0_7) v_main_~d~0_14) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_7, 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] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L290 TraceCheckUtils]: 62: Hoare triple {4958#false} [128] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_9)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L290 TraceCheckUtils]: 63: Hoare triple {4958#false} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L272 TraceCheckUtils]: 64: Hoare triple {4958#false} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L290 TraceCheckUtils]: 65: Hoare triple {4958#false} [119] __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] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {4958#false} [124] 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[] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L290 TraceCheckUtils]: 67: Hoare triple {4958#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4958#false} {4958#false} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L272 TraceCheckUtils]: 69: Hoare triple {4958#false} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L290 TraceCheckUtils]: 70: Hoare triple {4958#false} [119] __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] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L290 TraceCheckUtils]: 71: Hoare triple {4958#false} [124] 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[] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {4958#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4958#false} {4958#false} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {4958#false} is VALID [2022-04-08 01:38:20,198 INFO L290 TraceCheckUtils]: 74: Hoare triple {4958#false} [127] L46-->L52: Formula: (and (= v_main_~p~0_5 (let ((.cse0 (div v_main_~p~0_6 2))) (ite (and (< v_main_~p~0_6 0) (not (= (mod v_main_~p~0_6 2) 0))) (+ .cse0 1) .cse0))) (= v_main_~d~0_4 (let ((.cse1 (div v_main_~d~0_5 2))) (ite (and (< v_main_~d~0_5 0) (not (= (mod v_main_~d~0_5 2) 0))) (+ .cse1 1) .cse1))) (not (= v_main_~p~0_6 1))) InVars {main_~p~0=v_main_~p~0_6, main_~d~0=v_main_~d~0_5} OutVars{main_~p~0=v_main_~p~0_5, main_~d~0=v_main_~d~0_4} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L290 TraceCheckUtils]: 75: Hoare triple {4958#false} [134] L52-->L52-2: Formula: (and (<= v_main_~d~0_6 v_main_~r~0_5) (= (+ v_main_~p~0_7 v_main_~q~0_5) v_main_~q~0_4) (= v_main_~r~0_4 (+ v_main_~r~0_5 (* (- 1) v_main_~d~0_6)))) InVars {main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_4, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L290 TraceCheckUtils]: 76: Hoare triple {4958#false} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L272 TraceCheckUtils]: 77: Hoare triple {4958#false} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L290 TraceCheckUtils]: 78: Hoare triple {4958#false} [119] __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] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L290 TraceCheckUtils]: 79: Hoare triple {4958#false} [124] 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[] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L290 TraceCheckUtils]: 80: Hoare triple {4958#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {4958#false} {4958#false} [141] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L272 TraceCheckUtils]: 82: Hoare triple {4958#false} [121] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L290 TraceCheckUtils]: 83: Hoare triple {4958#false} [119] __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] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L290 TraceCheckUtils]: 84: Hoare triple {4958#false} [124] 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[] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L290 TraceCheckUtils]: 85: Hoare triple {4958#false} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4958#false} {4958#false} [142] __VERIFIER_assertEXIT-->L46: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (* v_main_~p~0_12 v_main_~B~0_9) v_main_~d~0_15) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_9, 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] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L290 TraceCheckUtils]: 87: Hoare triple {4958#false} [127] L46-->L52: Formula: (and (= v_main_~p~0_5 (let ((.cse0 (div v_main_~p~0_6 2))) (ite (and (< v_main_~p~0_6 0) (not (= (mod v_main_~p~0_6 2) 0))) (+ .cse0 1) .cse0))) (= v_main_~d~0_4 (let ((.cse1 (div v_main_~d~0_5 2))) (ite (and (< v_main_~d~0_5 0) (not (= (mod v_main_~d~0_5 2) 0))) (+ .cse1 1) .cse1))) (not (= v_main_~p~0_6 1))) InVars {main_~p~0=v_main_~p~0_6, main_~d~0=v_main_~d~0_5} OutVars{main_~p~0=v_main_~p~0_5, main_~d~0=v_main_~d~0_4} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L290 TraceCheckUtils]: 88: Hoare triple {4958#false} [134] L52-->L52-2: Formula: (and (<= v_main_~d~0_6 v_main_~r~0_5) (= (+ v_main_~p~0_7 v_main_~q~0_5) v_main_~q~0_4) (= v_main_~r~0_4 (+ v_main_~r~0_5 (* (- 1) v_main_~d~0_6)))) InVars {main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_4, main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L290 TraceCheckUtils]: 89: Hoare triple {4958#false} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4958#false} is VALID [2022-04-08 01:38:20,199 INFO L272 TraceCheckUtils]: 90: Hoare triple {4958#false} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_11 (+ v_main_~r~0_12 (* v_main_~B~0_8 v_main_~q~0_9))) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_8, 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] {4958#false} is VALID [2022-04-08 01:38:20,200 INFO L290 TraceCheckUtils]: 91: Hoare triple {4958#false} [119] __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] {4958#false} is VALID [2022-04-08 01:38:20,200 INFO L290 TraceCheckUtils]: 92: Hoare triple {4958#false} [123] 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[] {4958#false} is VALID [2022-04-08 01:38:20,200 INFO L290 TraceCheckUtils]: 93: Hoare triple {4958#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4958#false} is VALID [2022-04-08 01:38:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-04-08 01:38:20,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 01:38:20,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:38:20,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011048770] [2022-04-08 01:38:20,200 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:38:20,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383147423] [2022-04-08 01:38:20,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383147423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:38:20,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:38:20,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 01:38:20,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201299226] [2022-04-08 01:38:20,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:38:20,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 94 [2022-04-08 01:38:20,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:38:20,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 01:38:20,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:38:20,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 01:38:20,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:38:20,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 01:38:20,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 01:38:20,236 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 01:38:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:38:20,380 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-08 01:38:20,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 01:38:20,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 94 [2022-04-08 01:38:20,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:38:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 01:38:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-04-08 01:38:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 01:38:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-04-08 01:38:20,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2022-04-08 01:38:20,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:38:20,435 INFO L225 Difference]: With dead ends: 103 [2022-04-08 01:38:20,435 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 01:38:20,435 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-08 01:38:20,439 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 01:38:20,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 103 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 01:38:20,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 01:38:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 01:38:20,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:38:20,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 01:38:20,440 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 01:38:20,440 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 01:38:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:38:20,440 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 01:38:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 01:38:20,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:38:20,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:38:20,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 01:38:20,440 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 01:38:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:38:20,440 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 01:38:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 01:38:20,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:38:20,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:38:20,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:38:20,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:38:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 01:38:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 01:38:20,441 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2022-04-08 01:38:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:38:20,441 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 01:38:20,441 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 01:38:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 01:38:20,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:38:20,443 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 01:38:20,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 01:38:20,664 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:38:20,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 01:38:21,183 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 01:38:21,183 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-08 01:38:21,184 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-08 01:38:21,184 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 01:38:21,184 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 01:38:21,184 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-08 01:38:21,184 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-08 01:38:21,184 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-08 01:38:21,184 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-08 01:38:21,184 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-08 01:38:21,184 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-08 01:38:21,184 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 61) the Hoare annotation is: true [2022-04-08 01:38:21,184 INFO L885 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-04-08 01:38:21,184 INFO L882 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-04-08 01:38:21,184 INFO L878 garLoopResultBuilder]: At program point L34-2(lines 34 42) the Hoare annotation is: (let ((.cse0 (<= 0 main_~A~0)) (.cse1 (= main_~A~0 main_~r~0)) (.cse2 (<= main_~A~0 1)) (.cse3 (= main_~q~0 0)) (.cse4 (= main_~B~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (and .cse0 .cse1 (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse2 .cse3 .cse4))) [2022-04-08 01:38:21,184 INFO L882 garLoopResultBuilder]: For program point L52-2(lines 22 61) no Hoare annotation was computed. [2022-04-08 01:38:21,184 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (<= 0 main_~A~0)) (.cse1 (= main_~A~0 main_~r~0)) (.cse2 (<= main_~A~0 1)) (.cse3 (= main_~q~0 0)) (.cse4 (= main_~B~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (and .cse0 .cse1 (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse2 .cse3 .cse4))) [2022-04-08 01:38:21,184 INFO L878 garLoopResultBuilder]: At program point L44-1(lines 44 56) the Hoare annotation is: (let ((.cse0 (= main_~B~0 1)) (.cse1 (= main_~B~0 main_~d~0)) (.cse2 (= main_~p~0 1))) (or (and (= main_~A~0 main_~r~0) (= main_~q~0 0) .cse0 .cse1 .cse2) (and (= main_~q~0 main_~p~0) (= (+ main_~d~0 main_~r~0) main_~A~0) .cse0 .cse1 .cse2))) [2022-04-08 01:38:21,184 INFO L878 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0)) (.cse2 (= main_~B~0 1)) (.cse3 (= main_~B~0 main_~d~0)) (.cse4 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse1 .cse2) (and (= (+ main_~d~0 main_~r~0) main_~A~0) .cse2 (= main_~q~0 1) .cse3 .cse4))) [2022-04-08 01:38:21,184 INFO L878 garLoopResultBuilder]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse0 (<= 0 main_~A~0)) (.cse1 (= main_~A~0 main_~r~0)) (.cse2 (<= main_~A~0 1)) (.cse3 (= main_~q~0 0)) (.cse4 (= main_~B~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (and .cse0 .cse1 (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse2 .cse3 .cse4))) [2022-04-08 01:38:21,185 INFO L878 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1)) [2022-04-08 01:38:21,185 INFO L878 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0)) (.cse2 (= main_~B~0 1)) (.cse3 (= main_~B~0 main_~d~0)) (.cse4 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse1 .cse2) (and (= (+ main_~d~0 main_~r~0) main_~A~0) .cse2 (= main_~q~0 1) .cse3 .cse4))) [2022-04-08 01:38:21,185 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (<= 0 main_~A~0)) (.cse1 (= main_~A~0 main_~r~0)) (.cse2 (<= main_~A~0 1)) (.cse3 (= main_~q~0 0)) (.cse4 (= main_~B~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (and .cse0 .cse1 (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse2 .cse3 .cse4))) [2022-04-08 01:38:21,185 INFO L882 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-04-08 01:38:21,185 INFO L882 garLoopResultBuilder]: For program point L46(lines 44 56) no Hoare annotation was computed. [2022-04-08 01:38:21,185 INFO L882 garLoopResultBuilder]: For program point L37(lines 34 42) no Hoare annotation was computed. [2022-04-08 01:38:21,185 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 22 61) no Hoare annotation was computed. [2022-04-08 01:38:21,185 INFO L882 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2022-04-08 01:38:21,185 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 22 61) no Hoare annotation was computed. [2022-04-08 01:38:21,185 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-08 01:38:21,185 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-08 01:38:21,185 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-08 01:38:21,185 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-08 01:38:21,185 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-08 01:38:21,185 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-08 01:38:21,187 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:38:21,188 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-08 01:38:21,192 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-08 01:38:21,194 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-08 01:38:21,194 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-08 01:38:21,194 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-08 01:38:21,194 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-08 01:38:21,194 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-08 01:38:21,194 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 01:38:21,194 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 01:38:21,194 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 01:38:21,194 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 01:38:21,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 01:38:21 BasicIcfg [2022-04-08 01:38:21,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 01:38:21,204 INFO L158 Benchmark]: Toolchain (without parser) took 31414.54ms. Allocated memory was 212.9MB in the beginning and 319.8MB in the end (delta: 107.0MB). Free memory was 187.2MB in the beginning and 118.5MB in the end (delta: 68.8MB). Peak memory consumption was 176.7MB. Max. memory is 8.0GB. [2022-04-08 01:38:21,204 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 212.9MB. Free memory is still 173.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 01:38:21,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.18ms. Allocated memory is still 212.9MB. Free memory was 187.0MB in the beginning and 176.5MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 01:38:21,204 INFO L158 Benchmark]: Boogie Preprocessor took 21.61ms. Allocated memory is still 212.9MB. Free memory was 176.5MB in the beginning and 174.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 01:38:21,205 INFO L158 Benchmark]: RCFGBuilder took 202.20ms. Allocated memory is still 212.9MB. Free memory was 174.9MB in the beginning and 163.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 01:38:21,205 INFO L158 Benchmark]: IcfgTransformer took 20.19ms. Allocated memory is still 212.9MB. Free memory was 163.7MB in the beginning and 161.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 01:38:21,205 INFO L158 Benchmark]: TraceAbstraction took 30993.81ms. Allocated memory was 212.9MB in the beginning and 319.8MB in the end (delta: 107.0MB). Free memory was 161.5MB in the beginning and 118.5MB in the end (delta: 43.0MB). Peak memory consumption was 151.6MB. Max. memory is 8.0GB. [2022-04-08 01:38:21,206 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 212.9MB. Free memory is still 173.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 167.18ms. Allocated memory is still 212.9MB. Free memory was 187.0MB in the beginning and 176.5MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.61ms. Allocated memory is still 212.9MB. Free memory was 176.5MB in the beginning and 174.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 202.20ms. Allocated memory is still 212.9MB. Free memory was 174.9MB in the beginning and 163.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 20.19ms. Allocated memory is still 212.9MB. Free memory was 163.7MB in the beginning and 161.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 30993.81ms. Allocated memory was 212.9MB in the beginning and 319.8MB in the end (delta: 107.0MB). Free memory was 161.5MB in the beginning and 118.5MB in the end (delta: 43.0MB). Peak memory consumption was 151.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.9s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 203 mSDsluCounter, 988 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 632 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1090 IncrementalHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 356 mSDtfsCounter, 1090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 645 GetRequests, 568 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=7, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 83 PreInvPairs, 103 NumberOfFragments, 352 HoareAnnotationTreeSize, 83 FomulaSimplifications, 28 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 251 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 648 ConstructedInterpolants, 0 QuantifiedInterpolants, 3057 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1081 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 1458/1489 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((0 <= A && A == r) && A <= 1) && q == 0) && B == 1) && B == d) && p == 1) || ((((((0 <= A && A == r) && B * 2 == d) && p == 2) && A <= 1) && q == 0) && B == 1) RESULT: Ultimate proved your program to be correct! [2022-04-08 01:38:21,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...