/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/egcd-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 00:37:44,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 00:37:44,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 00:37:44,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 00:37:44,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 00:37:44,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 00:37:44,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 00:37:44,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 00:37:44,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 00:37:44,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 00:37:44,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 00:37:44,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 00:37:44,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 00:37:44,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 00:37:44,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 00:37:44,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 00:37:44,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 00:37:44,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 00:37:44,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 00:37:44,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 00:37:44,206 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 00:37:44,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 00:37:44,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 00:37:44,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 00:37:44,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 00:37:44,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 00:37:44,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 00:37:44,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 00:37:44,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 00:37:44,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 00:37:44,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 00:37:44,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 00:37:44,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 00:37:44,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 00:37:44,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 00:37:44,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 00:37:44,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 00:37:44,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 00:37:44,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 00:37:44,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 00:37:44,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 00:37:44,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 00:37:44,220 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 00:37:44,240 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 00:37:44,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 00:37:44,241 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 00:37:44,241 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 00:37:44,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 00:37:44,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 00:37:44,242 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 00:37:44,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 00:37:44,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 00:37:44,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 00:37:44,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 00:37:44,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 00:37:44,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 00:37:44,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 00:37:44,243 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 00:37:44,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 00:37:44,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 00:37:44,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 00:37:44,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 00:37:44,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 00:37:44,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 00:37:44,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 00:37:44,244 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 00:37:44,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 00:37:44,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 00:37:44,244 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 00:37:44,244 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 00:37:44,245 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 00:37:44,245 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 00:37:44,245 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 00:37:44,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 00:37:44,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 00:37:44,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 00:37:44,405 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 00:37:44,405 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 00:37:44,406 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound2.c [2022-04-08 00:37:44,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b46901b8/9a01e27e166d4347869b7f54f189ffcb/FLAG05a9a7ffe [2022-04-08 00:37:44,800 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 00:37:44,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound2.c [2022-04-08 00:37:44,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b46901b8/9a01e27e166d4347869b7f54f189ffcb/FLAG05a9a7ffe [2022-04-08 00:37:44,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b46901b8/9a01e27e166d4347869b7f54f189ffcb [2022-04-08 00:37:44,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 00:37:44,819 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 00:37:44,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 00:37:44,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 00:37:44,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 00:37:44,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:37:44" (1/1) ... [2022-04-08 00:37:44,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68a48634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:37:44, skipping insertion in model container [2022-04-08 00:37:44,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:37:44" (1/1) ... [2022-04-08 00:37:44,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 00:37:44,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 00:37:44,967 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/egcd-ll_valuebound2.c[489,502] [2022-04-08 00:37:44,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 00:37:44,986 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 00:37:44,996 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/egcd-ll_valuebound2.c[489,502] [2022-04-08 00:37:45,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 00:37:45,020 INFO L208 MainTranslator]: Completed translation [2022-04-08 00:37:45,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:37:45 WrapperNode [2022-04-08 00:37:45,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 00:37:45,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 00:37:45,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 00:37:45,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 00:37:45,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:37:45" (1/1) ... [2022-04-08 00:37:45,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:37:45" (1/1) ... [2022-04-08 00:37:45,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:37:45" (1/1) ... [2022-04-08 00:37:45,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:37:45" (1/1) ... [2022-04-08 00:37:45,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:37:45" (1/1) ... [2022-04-08 00:37:45,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:37:45" (1/1) ... [2022-04-08 00:37:45,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:37:45" (1/1) ... [2022-04-08 00:37:45,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 00:37:45,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 00:37:45,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 00:37:45,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 00:37:45,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:37:45" (1/1) ... [2022-04-08 00:37:45,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 00:37:45,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:37:45,072 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 00:37:45,074 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 00:37:45,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 00:37:45,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 00:37:45,103 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 00:37:45,103 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 00:37:45,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 00:37:45,105 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 00:37:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 00:37:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 00:37:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 00:37:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 00:37:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 00:37:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 00:37:45,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 00:37:45,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 00:37:45,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 00:37:45,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 00:37:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 00:37:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 00:37:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 00:37:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 00:37:45,158 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 00:37:45,159 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 00:37:45,308 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 00:37:45,313 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 00:37:45,313 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 00:37:45,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:37:45 BoogieIcfgContainer [2022-04-08 00:37:45,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 00:37:45,315 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 00:37:45,315 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 00:37:45,316 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 00:37:45,318 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:37:45" (1/1) ... [2022-04-08 00:37:45,319 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 00:37:45,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 12:37:45 BasicIcfg [2022-04-08 00:37:45,346 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 00:37:45,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 00:37:45,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 00:37:45,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 00:37:45,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:37:44" (1/4) ... [2022-04-08 00:37:45,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebbd39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:37:45, skipping insertion in model container [2022-04-08 00:37:45,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:37:45" (2/4) ... [2022-04-08 00:37:45,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebbd39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:37:45, skipping insertion in model container [2022-04-08 00:37:45,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:37:45" (3/4) ... [2022-04-08 00:37:45,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebbd39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:37:45, skipping insertion in model container [2022-04-08 00:37:45,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 12:37:45" (4/4) ... [2022-04-08 00:37:45,351 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound2.cqvasr [2022-04-08 00:37:45,354 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 00:37:45,355 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 00:37:45,387 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 00:37:45,391 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 00:37:45,391 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 00:37:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 00:37:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 00:37:45,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:37:45,430 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:37:45,430 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:37:45,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:37:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1381881312, now seen corresponding path program 1 times [2022-04-08 00:37:45,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:37:45,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21436826] [2022-04-08 00:37:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:37:45,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:37:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:45,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 00:37:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:45,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {40#true} is VALID [2022-04-08 00:37:45,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-08 00:37:45,643 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-08 00:37:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 00:37:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:45,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-08 00:37:45,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-08 00:37:45,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 00:37:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:45,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-08 00:37:45,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-08 00:37:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 00:37:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:45,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-08 00:37:45,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-08 00:37:45,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 00:37:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:45,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-08 00:37:45,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-08 00:37:45,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 00:37:45,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {40#true} is VALID [2022-04-08 00:37:45,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-08 00:37:45,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-08 00:37:45,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-08 00:37:45,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {40#true} is VALID [2022-04-08 00:37:45,695 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-08 00:37:45,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-08 00:37:45,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,697 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-08 00:37:45,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {41#false} is VALID [2022-04-08 00:37:45,698 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-08 00:37:45,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-08 00:37:45,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,700 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41#false} {41#false} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-08 00:37:45,700 INFO L272 TraceCheckUtils]: 17: Hoare triple {41#false} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-08 00:37:45,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-08 00:37:45,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,702 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-08 00:37:45,702 INFO L272 TraceCheckUtils]: 22: Hoare triple {41#false} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-08 00:37:45,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-08 00:37:45,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,703 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-08 00:37:45,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {41#false} is VALID [2022-04-08 00:37:45,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {41#false} [107] L43-2-->L35-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,706 INFO L272 TraceCheckUtils]: 29: Hoare triple {41#false} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {41#false} is VALID [2022-04-08 00:37:45,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} [113] __VERIFIER_assertENTRY-->L11: 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] {41#false} is VALID [2022-04-08 00:37:45,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} [116] L11-->L12: 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[] {41#false} is VALID [2022-04-08 00:37:45,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {41#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-08 00:37:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 00:37:45,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:37:45,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21436826] [2022-04-08 00:37:45,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21436826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:37:45,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:37:45,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 00:37:45,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29900735] [2022-04-08 00:37:45,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:37:45,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 00:37:45,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:37:45,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:37:45,757 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 00:37:45,761 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 00:37:45,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:37:45,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 00:37:45,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 00:37:45,785 INFO L87 Difference]: Start difference. First operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:37:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:45,958 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2022-04-08 00:37:45,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 00:37:45,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 00:37:45,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:37:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:37:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-08 00:37:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:37:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-08 00:37:45,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2022-04-08 00:37:46,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:37:46,094 INFO L225 Difference]: With dead ends: 67 [2022-04-08 00:37:46,094 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 00:37:46,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 00:37:46,098 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:37:46,099 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:37:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 00:37:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 00:37:46,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:37:46,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 00:37:46,119 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 00:37:46,120 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 00:37:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:46,123 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 00:37:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 00:37:46,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:37:46,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:37:46,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-08 00:37:46,124 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-08 00:37:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:46,126 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 00:37:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 00:37:46,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:37:46,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:37:46,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:37:46,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:37:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 00:37:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 00:37:46,130 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 33 [2022-04-08 00:37:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:37:46,130 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 00:37:46,131 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:37:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 00:37:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 00:37:46,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:37:46,132 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:37:46,132 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 00:37:46,132 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:37:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:37:46,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1975235811, now seen corresponding path program 1 times [2022-04-08 00:37:46,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:37:46,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348761014] [2022-04-08 00:37:46,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:37:46,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:37:46,150 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:37:46,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1250095034] [2022-04-08 00:37:46,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:37:46,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:37:46,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:37:46,154 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 00:37:46,166 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 00:37:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:46,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 00:37:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:46,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:37:46,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {276#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-08 00:37:46,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {276#true} is VALID [2022-04-08 00:37:46,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-08 00:37:46,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {276#true} {276#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-08 00:37:46,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {276#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-08 00:37:46,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {276#true} is VALID [2022-04-08 00:37:46,372 INFO L272 TraceCheckUtils]: 6: Hoare triple {276#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-08 00:37:46,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#true} [99] assume_abort_if_notENTRY-->L8: 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] {276#true} is VALID [2022-04-08 00:37:46,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#true} [102] L8-->L8-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[] {276#true} is VALID [2022-04-08 00:37:46,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-08 00:37:46,373 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {276#true} {276#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-08 00:37:46,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {276#true} is VALID [2022-04-08 00:37:46,373 INFO L272 TraceCheckUtils]: 12: Hoare triple {276#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-08 00:37:46,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {276#true} [99] assume_abort_if_notENTRY-->L8: 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] {276#true} is VALID [2022-04-08 00:37:46,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {276#true} [102] L8-->L8-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[] {276#true} is VALID [2022-04-08 00:37:46,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {276#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-08 00:37:46,374 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {276#true} {276#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-08 00:37:46,374 INFO L272 TraceCheckUtils]: 17: Hoare triple {276#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-08 00:37:46,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {276#true} [99] assume_abort_if_notENTRY-->L8: 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] {276#true} is VALID [2022-04-08 00:37:46,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {276#true} [102] L8-->L8-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[] {276#true} is VALID [2022-04-08 00:37:46,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {276#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-08 00:37:46,374 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {276#true} {276#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-08 00:37:46,375 INFO L272 TraceCheckUtils]: 22: Hoare triple {276#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-08 00:37:46,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {276#true} [99] assume_abort_if_notENTRY-->L8: 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] {276#true} is VALID [2022-04-08 00:37:46,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {276#true} [102] L8-->L8-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[] {276#true} is VALID [2022-04-08 00:37:46,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {276#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-08 00:37:46,375 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {276#true} {276#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-08 00:37:46,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {276#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-08 00:37:46,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-08 00:37:46,377 INFO L272 TraceCheckUtils]: 29: Hoare triple {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {369#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:37:46,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {369#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: 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] {373#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:37:46,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {373#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: 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[] {277#false} is VALID [2022-04-08 00:37:46,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {277#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {277#false} is VALID [2022-04-08 00:37:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 00:37:46,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:37:46,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:37:46,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348761014] [2022-04-08 00:37:46,390 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:37:46,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250095034] [2022-04-08 00:37:46,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250095034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:37:46,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:37:46,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 00:37:46,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410782773] [2022-04-08 00:37:46,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:37:46,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-08 00:37:46,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:37:46,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:37:46,409 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 00:37:46,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 00:37:46,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:37:46,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 00:37:46,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 00:37:46,411 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:37:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:46,604 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-08 00:37:46,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 00:37:46,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-08 00:37:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:37:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:37:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 00:37:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:37:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 00:37:46,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 00:37:46,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:37:46,669 INFO L225 Difference]: With dead ends: 48 [2022-04-08 00:37:46,669 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 00:37:46,670 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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 00:37:46,671 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:37:46,671 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:37:46,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 00:37:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-08 00:37:46,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:37:46,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 00:37:46,678 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 00:37:46,679 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 00:37:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:46,681 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-08 00:37:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-08 00:37:46,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:37:46,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:37:46,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-08 00:37:46,682 INFO L87 Difference]: Start difference. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-08 00:37:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:46,685 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-08 00:37:46,685 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-08 00:37:46,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:37:46,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:37:46,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:37:46,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:37:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 00:37:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-04-08 00:37:46,688 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 33 [2022-04-08 00:37:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:37:46,688 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-04-08 00:37:46,688 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:37:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-08 00:37:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 00:37:46,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:37:46,689 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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 00:37:46,707 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 00:37:46,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:37:46,906 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:37:46,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:37:46,907 INFO L85 PathProgramCache]: Analyzing trace with hash -759782395, now seen corresponding path program 1 times [2022-04-08 00:37:46,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:37:46,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459452089] [2022-04-08 00:37:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:37:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:37:46,927 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:37:46,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [998202625] [2022-04-08 00:37:46,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:37:46,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:37:46,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:37:46,933 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 00:37:46,934 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 00:37:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:46,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 00:37:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:46,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:37:47,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-08 00:37:47,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {619#true} is VALID [2022-04-08 00:37:47,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-08 00:37:47,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-08 00:37:47,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-08 00:37:47,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {619#true} is VALID [2022-04-08 00:37:47,424 INFO L272 TraceCheckUtils]: 6: Hoare triple {619#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-08 00:37:47,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#true} [99] assume_abort_if_notENTRY-->L8: 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] {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:37:47,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:47,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:47,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {619#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:47,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:47,427 INFO L272 TraceCheckUtils]: 12: Hoare triple {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-08 00:37:47,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {619#true} [99] assume_abort_if_notENTRY-->L8: 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] {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:37:47,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:47,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:47,429 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {675#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:47,429 INFO L272 TraceCheckUtils]: 17: Hoare triple {675#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-08 00:37:47,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {619#true} [99] assume_abort_if_notENTRY-->L8: 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] {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:37:47,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:47,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:47,432 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {675#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {691#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:47,432 INFO L272 TraceCheckUtils]: 22: Hoare triple {691#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-08 00:37:47,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {619#true} [99] assume_abort_if_notENTRY-->L8: 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] {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:37:47,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:47,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:47,434 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {691#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {707#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:47,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {707#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (<= main_~x~0 2))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 00:37:47,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 00:37:47,435 INFO L272 TraceCheckUtils]: 29: Hoare triple {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {619#true} is VALID [2022-04-08 00:37:47,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {619#true} [113] __VERIFIER_assertENTRY-->L11: 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] {619#true} is VALID [2022-04-08 00:37:47,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {619#true} [117] L11-->L11-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[] {619#true} is VALID [2022-04-08 00:37:47,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {619#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-08 00:37:47,436 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {619#true} {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 00:37:47,437 INFO L272 TraceCheckUtils]: 34: Hoare triple {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {733#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:37:47,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {733#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: 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] {737#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:37:47,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {737#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: 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[] {620#false} is VALID [2022-04-08 00:37:47,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {620#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {620#false} is VALID [2022-04-08 00:37:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 00:37:47,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:37:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:37:47,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459452089] [2022-04-08 00:37:47,445 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:37:47,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998202625] [2022-04-08 00:37:47,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998202625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:37:47,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:37:47,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 00:37:47,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013710509] [2022-04-08 00:37:47,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:37:47,446 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2022-04-08 00:37:47,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:37:47,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 00:37:47,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:37:47,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 00:37:47,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:37:47,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 00:37:47,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-08 00:37:47,467 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 00:37:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:47,917 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-08 00:37:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 00:37:47,918 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2022-04-08 00:37:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:37:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 00:37:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-08 00:37:47,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 00:37:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-08 00:37:47,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 65 transitions. [2022-04-08 00:37:47,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:37:47,978 INFO L225 Difference]: With dead ends: 52 [2022-04-08 00:37:47,978 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 00:37:47,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 00:37:47,979 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 30 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 00:37:47,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 168 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 00:37:47,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 00:37:48,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-08 00:37:48,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:37:48,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 00:37:48,015 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 00:37:48,016 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 00:37:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:48,018 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-08 00:37:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-08 00:37:48,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:37:48,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:37:48,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-08 00:37:48,019 INFO L87 Difference]: Start difference. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-08 00:37:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:48,021 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-08 00:37:48,021 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-08 00:37:48,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:37:48,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:37:48,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:37:48,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:37:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 00:37:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2022-04-08 00:37:48,024 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 38 [2022-04-08 00:37:48,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:37:48,024 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2022-04-08 00:37:48,024 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 00:37:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-08 00:37:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 00:37:48,025 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:37:48,025 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:37:48,045 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 00:37:48,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 00:37:48,240 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:37:48,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:37:48,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1840397536, now seen corresponding path program 1 times [2022-04-08 00:37:48,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:37:48,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268622414] [2022-04-08 00:37:48,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:37:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:37:48,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:37:48,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1640008733] [2022-04-08 00:37:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:37:48,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:37:48,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:37:48,258 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 00:37:48,265 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 00:37:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:48,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 00:37:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:48,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:37:48,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {1003#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 00:37:48,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {1003#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {1003#true} is VALID [2022-04-08 00:37:48,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {1003#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 00:37:48,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1003#true} {1003#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 00:37:48,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {1003#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 00:37:48,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {1003#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1003#true} is VALID [2022-04-08 00:37:48,716 INFO L272 TraceCheckUtils]: 6: Hoare triple {1003#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-08 00:37:48,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {1003#true} [99] assume_abort_if_notENTRY-->L8: 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] {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:37:48,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:48,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:48,718 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1003#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:48,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:48,719 INFO L272 TraceCheckUtils]: 12: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-08 00:37:48,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {1003#true} [99] assume_abort_if_notENTRY-->L8: 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] {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:37:48,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:48,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:48,721 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1059#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:48,721 INFO L272 TraceCheckUtils]: 17: Hoare triple {1059#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-08 00:37:48,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {1003#true} [99] assume_abort_if_notENTRY-->L8: 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] {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:37:48,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:48,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:48,723 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1059#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1075#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:48,723 INFO L272 TraceCheckUtils]: 22: Hoare triple {1075#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-08 00:37:48,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {1003#true} [99] assume_abort_if_notENTRY-->L8: 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] {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:37:48,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:48,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:37:48,725 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1075#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1091#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:48,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {1091#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (<= main_~x~0 2))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:48,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:48,726 INFO L272 TraceCheckUtils]: 29: Hoare triple {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1003#true} is VALID [2022-04-08 00:37:48,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {1003#true} [113] __VERIFIER_assertENTRY-->L11: 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] {1003#true} is VALID [2022-04-08 00:37:48,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {1003#true} [117] L11-->L11-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[] {1003#true} is VALID [2022-04-08 00:37:48,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {1003#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 00:37:48,727 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1003#true} {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:48,727 INFO L272 TraceCheckUtils]: 34: Hoare triple {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1003#true} is VALID [2022-04-08 00:37:48,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {1003#true} [113] __VERIFIER_assertENTRY-->L11: 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] {1003#true} is VALID [2022-04-08 00:37:48,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {1003#true} [117] L11-->L11-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[] {1003#true} is VALID [2022-04-08 00:37:48,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {1003#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-08 00:37:48,728 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1003#true} {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:37:48,729 INFO L272 TraceCheckUtils]: 39: Hoare triple {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:37:48,729 INFO L290 TraceCheckUtils]: 40: Hoare triple {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: 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] {1136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:37:48,729 INFO L290 TraceCheckUtils]: 41: Hoare triple {1136#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: 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[] {1004#false} is VALID [2022-04-08 00:37:48,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {1004#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1004#false} is VALID [2022-04-08 00:37:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 00:37:48,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:37:48,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:37:48,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268622414] [2022-04-08 00:37:48,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:37:48,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640008733] [2022-04-08 00:37:48,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640008733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:37:48,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:37:48,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 00:37:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229897120] [2022-04-08 00:37:48,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:37:48,731 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 43 [2022-04-08 00:37:48,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:37:48,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 00:37:48,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:37:48,751 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 00:37:48,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:37:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 00:37:48,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-08 00:37:48,753 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 00:37:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:49,274 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-04-08 00:37:49,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 00:37:49,275 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 43 [2022-04-08 00:37:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:37:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 00:37:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-08 00:37:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 00:37:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-08 00:37:49,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 65 transitions. [2022-04-08 00:37:49,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:37:49,334 INFO L225 Difference]: With dead ends: 74 [2022-04-08 00:37:49,334 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 00:37:49,335 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 00:37:49,335 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 00:37:49,336 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 194 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 00:37:49,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 00:37:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 00:37:49,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:37:49,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 00:37:49,391 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 00:37:49,392 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 00:37:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:49,395 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-08 00:37:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-08 00:37:49,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:37:49,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:37:49,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-08 00:37:49,396 INFO L87 Difference]: Start difference. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-08 00:37:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:49,398 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-08 00:37:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-08 00:37:49,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:37:49,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:37:49,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:37:49,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:37:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 00:37:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-04-08 00:37:49,402 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 43 [2022-04-08 00:37:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:37:49,402 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-04-08 00:37:49,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 00:37:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-08 00:37:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 00:37:49,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:37:49,403 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:37:49,425 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 00:37:49,622 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:37:49,622 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:37:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:37:49,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1590647429, now seen corresponding path program 1 times [2022-04-08 00:37:49,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:37:49,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380396531] [2022-04-08 00:37:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:37:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:37:49,635 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:37:49,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501775253] [2022-04-08 00:37:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:37:49,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:37:49,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:37:49,637 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 00:37:49,638 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 00:37:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:49,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 00:37:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:49,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:37:49,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {1514#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-08 00:37:49,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {1514#true} is VALID [2022-04-08 00:37:49,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {1514#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-08 00:37:49,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-08 00:37:49,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {1514#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-08 00:37:49,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {1514#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1514#true} is VALID [2022-04-08 00:37:49,775 INFO L272 TraceCheckUtils]: 6: Hoare triple {1514#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-08 00:37:49,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {1514#true} [99] assume_abort_if_notENTRY-->L8: 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] {1514#true} is VALID [2022-04-08 00:37:49,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {1514#true} [102] L8-->L8-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[] {1514#true} is VALID [2022-04-08 00:37:49,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {1514#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-08 00:37:49,776 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1514#true} {1514#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-08 00:37:49,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {1514#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1514#true} is VALID [2022-04-08 00:37:49,776 INFO L272 TraceCheckUtils]: 12: Hoare triple {1514#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-08 00:37:49,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {1514#true} [99] assume_abort_if_notENTRY-->L8: 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] {1514#true} is VALID [2022-04-08 00:37:49,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {1514#true} [102] L8-->L8-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[] {1514#true} is VALID [2022-04-08 00:37:49,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {1514#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-08 00:37:49,776 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1514#true} {1514#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-08 00:37:49,776 INFO L272 TraceCheckUtils]: 17: Hoare triple {1514#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-08 00:37:49,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {1514#true} [99] assume_abort_if_notENTRY-->L8: 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] {1514#true} is VALID [2022-04-08 00:37:49,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {1514#true} [102] L8-->L8-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[] {1514#true} is VALID [2022-04-08 00:37:49,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {1514#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-08 00:37:49,777 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1514#true} {1514#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-08 00:37:49,777 INFO L272 TraceCheckUtils]: 22: Hoare triple {1514#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-08 00:37:49,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {1514#true} [99] assume_abort_if_notENTRY-->L8: 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] {1514#true} is VALID [2022-04-08 00:37:49,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {1514#true} [102] L8-->L8-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[] {1514#true} is VALID [2022-04-08 00:37:49,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {1514#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-08 00:37:49,777 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1514#true} {1514#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-08 00:37:49,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {1514#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1514#true} is VALID [2022-04-08 00:37:49,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {1514#true} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-08 00:37:49,778 INFO L272 TraceCheckUtils]: 29: Hoare triple {1514#true} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1514#true} is VALID [2022-04-08 00:37:49,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {1514#true} [113] __VERIFIER_assertENTRY-->L11: 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] {1514#true} is VALID [2022-04-08 00:37:49,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {1514#true} [117] L11-->L11-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[] {1514#true} is VALID [2022-04-08 00:37:49,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {1514#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-08 00:37:49,778 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1514#true} {1514#true} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1514#true} is VALID [2022-04-08 00:37:49,778 INFO L272 TraceCheckUtils]: 34: Hoare triple {1514#true} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1514#true} is VALID [2022-04-08 00:37:49,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {1514#true} [113] __VERIFIER_assertENTRY-->L11: 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] {1514#true} is VALID [2022-04-08 00:37:49,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {1514#true} [117] L11-->L11-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[] {1514#true} is VALID [2022-04-08 00:37:49,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {1514#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-08 00:37:49,778 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1514#true} {1514#true} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1514#true} is VALID [2022-04-08 00:37:49,779 INFO L272 TraceCheckUtils]: 39: Hoare triple {1514#true} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1514#true} is VALID [2022-04-08 00:37:49,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {1514#true} [113] __VERIFIER_assertENTRY-->L11: 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] {1514#true} is VALID [2022-04-08 00:37:49,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {1514#true} [117] L11-->L11-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[] {1514#true} is VALID [2022-04-08 00:37:49,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {1514#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-08 00:37:49,779 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1514#true} {1514#true} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1514#true} is VALID [2022-04-08 00:37:49,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {1514#true} [123] L38-->L35-2: Formula: (= v_main_~a~0_9 v_main_~b~0_11) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {1651#(= main_~b~0 main_~a~0)} is VALID [2022-04-08 00:37:49,780 INFO L272 TraceCheckUtils]: 45: Hoare triple {1651#(= main_~b~0 main_~a~0)} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {1655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:37:49,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {1655#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: 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] {1659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:37:49,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {1659#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: 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[] {1515#false} is VALID [2022-04-08 00:37:49,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {1515#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1515#false} is VALID [2022-04-08 00:37:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 00:37:49,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:37:49,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:37:49,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380396531] [2022-04-08 00:37:49,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:37:49,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501775253] [2022-04-08 00:37:49,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501775253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:37:49,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:37:49,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 00:37:49,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361460701] [2022-04-08 00:37:49,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:37:49,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-08 00:37:49,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:37:49,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 00:37:49,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:37:49,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 00:37:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:37:49,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 00:37:49,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 00:37:49,804 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 00:37:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:50,002 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2022-04-08 00:37:50,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 00:37:50,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-08 00:37:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:37:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 00:37:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 00:37:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 00:37:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 00:37:50,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 00:37:50,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:37:50,045 INFO L225 Difference]: With dead ends: 76 [2022-04-08 00:37:50,046 INFO L226 Difference]: Without dead ends: 74 [2022-04-08 00:37:50,046 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 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 00:37:50,047 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:37:50,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:37:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-08 00:37:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-08 00:37:50,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:37:50,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 00:37:50,114 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 00:37:50,114 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 00:37:50,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:50,117 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-08 00:37:50,117 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-08 00:37:50,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:37:50,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:37:50,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-08 00:37:50,118 INFO L87 Difference]: Start difference. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-08 00:37:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:50,120 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-08 00:37:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-08 00:37:50,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:37:50,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:37:50,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:37:50,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:37:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 00:37:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 101 transitions. [2022-04-08 00:37:50,123 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 101 transitions. Word has length 49 [2022-04-08 00:37:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:37:50,123 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 101 transitions. [2022-04-08 00:37:50,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 00:37:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-08 00:37:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 00:37:50,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:37:50,124 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:37:50,143 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 00:37:50,339 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:37:50,340 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:37:50,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:37:50,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1737902154, now seen corresponding path program 1 times [2022-04-08 00:37:50,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:37:50,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256823597] [2022-04-08 00:37:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:37:50,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:37:50,363 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:37:50,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1515216906] [2022-04-08 00:37:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:37:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:37:50,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:37:50,365 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 00:37:50,365 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 00:37:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:50,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 00:37:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:50,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:37:50,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {2049#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-08 00:37:50,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {2049#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {2049#true} is VALID [2022-04-08 00:37:50,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {2049#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-08 00:37:50,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2049#true} {2049#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-08 00:37:50,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {2049#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-08 00:37:50,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {2049#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2049#true} is VALID [2022-04-08 00:37:50,595 INFO L272 TraceCheckUtils]: 6: Hoare triple {2049#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-08 00:37:50,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {2049#true} [99] assume_abort_if_notENTRY-->L8: 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] {2049#true} is VALID [2022-04-08 00:37:50,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {2049#true} [102] L8-->L8-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[] {2049#true} is VALID [2022-04-08 00:37:50,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {2049#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-08 00:37:50,596 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2049#true} {2049#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-08 00:37:50,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {2049#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2049#true} is VALID [2022-04-08 00:37:50,596 INFO L272 TraceCheckUtils]: 12: Hoare triple {2049#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-08 00:37:50,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {2049#true} [99] assume_abort_if_notENTRY-->L8: 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] {2049#true} is VALID [2022-04-08 00:37:50,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {2049#true} [102] L8-->L8-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[] {2049#true} is VALID [2022-04-08 00:37:50,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {2049#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-08 00:37:50,596 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2049#true} {2049#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-08 00:37:50,596 INFO L272 TraceCheckUtils]: 17: Hoare triple {2049#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-08 00:37:50,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {2049#true} [99] assume_abort_if_notENTRY-->L8: 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] {2049#true} is VALID [2022-04-08 00:37:50,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {2049#true} [102] L8-->L8-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[] {2049#true} is VALID [2022-04-08 00:37:50,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {2049#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-08 00:37:50,597 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2049#true} {2049#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-08 00:37:50,597 INFO L272 TraceCheckUtils]: 22: Hoare triple {2049#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-08 00:37:50,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {2049#true} [99] assume_abort_if_notENTRY-->L8: 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] {2049#true} is VALID [2022-04-08 00:37:50,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {2049#true} [102] L8-->L8-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[] {2049#true} is VALID [2022-04-08 00:37:50,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {2049#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-08 00:37:50,597 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2049#true} {2049#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-08 00:37:50,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {2049#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 00:37:50,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 00:37:50,611 INFO L272 TraceCheckUtils]: 29: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2049#true} is VALID [2022-04-08 00:37:50,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {2049#true} [113] __VERIFIER_assertENTRY-->L11: 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] {2049#true} is VALID [2022-04-08 00:37:50,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {2049#true} [117] L11-->L11-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[] {2049#true} is VALID [2022-04-08 00:37:50,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {2049#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-08 00:37:50,612 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2049#true} {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 00:37:50,612 INFO L272 TraceCheckUtils]: 34: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2049#true} is VALID [2022-04-08 00:37:50,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {2049#true} [113] __VERIFIER_assertENTRY-->L11: 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] {2049#true} is VALID [2022-04-08 00:37:50,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {2049#true} [117] L11-->L11-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[] {2049#true} is VALID [2022-04-08 00:37:50,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {2049#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-08 00:37:50,613 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2049#true} {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 00:37:50,613 INFO L272 TraceCheckUtils]: 39: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2049#true} is VALID [2022-04-08 00:37:50,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {2049#true} [113] __VERIFIER_assertENTRY-->L11: 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] {2049#true} is VALID [2022-04-08 00:37:50,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {2049#true} [117] L11-->L11-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[] {2049#true} is VALID [2022-04-08 00:37:50,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {2049#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-08 00:37:50,614 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2049#true} {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 00:37:50,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 00:37:50,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 00:37:50,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 00:37:50,616 INFO L272 TraceCheckUtils]: 47: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2196#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:37:50,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {2196#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: 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] {2200#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:37:50,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {2200#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: 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[] {2050#false} is VALID [2022-04-08 00:37:50,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {2050#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2050#false} is VALID [2022-04-08 00:37:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 00:37:50,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:37:50,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:37:50,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256823597] [2022-04-08 00:37:50,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:37:50,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515216906] [2022-04-08 00:37:50,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515216906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:37:50,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:37:50,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 00:37:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676532488] [2022-04-08 00:37:50,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:37:50,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-08 00:37:50,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:37:50,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 00:37:50,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:37:50,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 00:37:50,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:37:50,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 00:37:50,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 00:37:50,642 INFO L87 Difference]: Start difference. First operand 74 states and 101 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 00:37:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:50,873 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2022-04-08 00:37:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 00:37:50,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-08 00:37:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:37:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 00:37:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-08 00:37:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 00:37:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-08 00:37:50,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-08 00:37:50,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:37:50,927 INFO L225 Difference]: With dead ends: 84 [2022-04-08 00:37:50,927 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 00:37:50,927 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 1 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 00:37:50,928 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:37:50,928 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 146 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:37:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 00:37:50,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-08 00:37:50,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:37:50,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 00:37:50,986 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 00:37:50,986 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 00:37:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:50,989 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-08 00:37:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-08 00:37:50,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:37:50,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:37:50,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-08 00:37:50,990 INFO L87 Difference]: Start difference. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-08 00:37:50,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:37:50,992 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-08 00:37:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-08 00:37:50,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:37:50,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:37:50,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:37:50,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:37:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 00:37:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2022-04-08 00:37:50,996 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 51 [2022-04-08 00:37:50,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:37:50,996 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2022-04-08 00:37:50,997 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 00:37:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2022-04-08 00:37:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 00:37:50,997 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:37:50,997 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:37:51,013 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 00:37:51,213 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:37:51,214 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:37:51,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:37:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1046589490, now seen corresponding path program 1 times [2022-04-08 00:37:51,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:37:51,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024507362] [2022-04-08 00:37:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:37:51,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:37:51,234 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:37:51,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1773582256] [2022-04-08 00:37:51,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:37:51,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:37:51,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:37:51,235 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 00:37:51,236 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 00:37:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:51,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 00:37:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:37:51,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:37:51,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {2618#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:37:51,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {2618#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {2618#true} is VALID [2022-04-08 00:37:51,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {2618#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:37:51,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2618#true} {2618#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:37:51,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {2618#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:37:51,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {2618#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2618#true} is VALID [2022-04-08 00:37:51,421 INFO L272 TraceCheckUtils]: 6: Hoare triple {2618#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:37:51,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: 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] {2618#true} is VALID [2022-04-08 00:37:51,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {2618#true} [102] L8-->L8-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[] {2618#true} is VALID [2022-04-08 00:37:51,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:37:51,421 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2618#true} {2618#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:37:51,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {2618#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2618#true} is VALID [2022-04-08 00:37:51,421 INFO L272 TraceCheckUtils]: 12: Hoare triple {2618#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:37:51,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: 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] {2618#true} is VALID [2022-04-08 00:37:51,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {2618#true} [102] L8-->L8-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[] {2618#true} is VALID [2022-04-08 00:37:51,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:37:51,422 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2618#true} {2618#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:37:51,422 INFO L272 TraceCheckUtils]: 17: Hoare triple {2618#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:37:51,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: 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] {2618#true} is VALID [2022-04-08 00:37:51,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {2618#true} [102] L8-->L8-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[] {2618#true} is VALID [2022-04-08 00:37:51,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:37:51,422 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2618#true} {2618#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:37:51,422 INFO L272 TraceCheckUtils]: 22: Hoare triple {2618#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:37:51,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: 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] {2618#true} is VALID [2022-04-08 00:37:51,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {2618#true} [102] L8-->L8-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[] {2618#true} is VALID [2022-04-08 00:37:51,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:37:51,423 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2618#true} {2618#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:37:51,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {2618#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2618#true} is VALID [2022-04-08 00:37:51,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {2618#true} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:37:51,423 INFO L272 TraceCheckUtils]: 29: Hoare triple {2618#true} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2618#true} is VALID [2022-04-08 00:37:51,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: 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] {2618#true} is VALID [2022-04-08 00:37:51,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {2618#true} [117] L11-->L11-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[] {2618#true} is VALID [2022-04-08 00:37:51,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {2618#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:37:51,424 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2618#true} {2618#true} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2618#true} is VALID [2022-04-08 00:37:51,424 INFO L272 TraceCheckUtils]: 34: Hoare triple {2618#true} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2618#true} is VALID [2022-04-08 00:37:51,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: 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] {2728#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:37:51,425 INFO L290 TraceCheckUtils]: 36: Hoare triple {2728#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [117] L11-->L11-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[] {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:37:51,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:37:51,427 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} {2618#true} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:37:51,427 INFO L272 TraceCheckUtils]: 39: Hoare triple {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2618#true} is VALID [2022-04-08 00:37:51,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: 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] {2618#true} is VALID [2022-04-08 00:37:51,427 INFO L290 TraceCheckUtils]: 41: Hoare triple {2618#true} [117] L11-->L11-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[] {2618#true} is VALID [2022-04-08 00:37:51,427 INFO L290 TraceCheckUtils]: 42: Hoare triple {2618#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:37:51,428 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2618#true} {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:37:51,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [123] L38-->L35-2: Formula: (= v_main_~a~0_9 v_main_~b~0_11) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:37:51,428 INFO L272 TraceCheckUtils]: 45: Hoare triple {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2618#true} is VALID [2022-04-08 00:37:51,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: 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] {2618#true} is VALID [2022-04-08 00:37:51,429 INFO L290 TraceCheckUtils]: 47: Hoare triple {2618#true} [117] L11-->L11-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[] {2618#true} is VALID [2022-04-08 00:37:51,429 INFO L290 TraceCheckUtils]: 48: Hoare triple {2618#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:37:51,429 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2618#true} {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:37:51,430 INFO L272 TraceCheckUtils]: 50: Hoare triple {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [112] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~p~0_12 v_main_~x~0_15) (* v_main_~r~0_12 v_main_~y~0_14)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_15, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:37:51,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: 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] {2781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:37:51,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {2781#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: 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[] {2619#false} is VALID [2022-04-08 00:37:51,431 INFO L290 TraceCheckUtils]: 53: Hoare triple {2619#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2619#false} is VALID [2022-04-08 00:37:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 00:37:51,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:38:03,425 INFO L290 TraceCheckUtils]: 53: Hoare triple {2619#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2619#false} is VALID [2022-04-08 00:38:03,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {2781#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: 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[] {2619#false} is VALID [2022-04-08 00:38:03,426 INFO L290 TraceCheckUtils]: 51: Hoare triple {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: 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] {2781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:38:03,427 INFO L272 TraceCheckUtils]: 50: Hoare triple {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [112] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~p~0_12 v_main_~x~0_15) (* v_main_~r~0_12 v_main_~y~0_14)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_15, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:38:03,428 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2618#true} {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:38:03,428 INFO L290 TraceCheckUtils]: 48: Hoare triple {2618#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:38:03,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {2618#true} [117] L11-->L11-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[] {2618#true} is VALID [2022-04-08 00:38:03,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: 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] {2618#true} is VALID [2022-04-08 00:38:03,428 INFO L272 TraceCheckUtils]: 45: Hoare triple {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2618#true} is VALID [2022-04-08 00:38:03,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [123] L38-->L35-2: Formula: (= v_main_~a~0_9 v_main_~b~0_11) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:38:03,432 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2618#true} {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:38:03,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {2618#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:38:03,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {2618#true} [117] L11-->L11-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[] {2618#true} is VALID [2022-04-08 00:38:03,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: 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] {2618#true} is VALID [2022-04-08 00:38:03,433 INFO L272 TraceCheckUtils]: 39: Hoare triple {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2618#true} is VALID [2022-04-08 00:38:03,433 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} {2618#true} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:38:03,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:38:03,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {2842#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [117] L11-->L11-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[] {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:38:03,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: 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] {2842#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 00:38:03,435 INFO L272 TraceCheckUtils]: 34: Hoare triple {2618#true} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2618#true} is VALID [2022-04-08 00:38:03,435 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2618#true} {2618#true} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2618#true} is VALID [2022-04-08 00:38:03,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {2618#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:38:03,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {2618#true} [117] L11-->L11-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[] {2618#true} is VALID [2022-04-08 00:38:03,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: 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] {2618#true} is VALID [2022-04-08 00:38:03,435 INFO L272 TraceCheckUtils]: 29: Hoare triple {2618#true} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2618#true} is VALID [2022-04-08 00:38:03,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {2618#true} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:38:03,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {2618#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2618#true} is VALID [2022-04-08 00:38:03,435 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2618#true} {2618#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:38:03,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:38:03,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {2618#true} [102] L8-->L8-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[] {2618#true} is VALID [2022-04-08 00:38:03,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: 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] {2618#true} is VALID [2022-04-08 00:38:03,436 INFO L272 TraceCheckUtils]: 22: Hoare triple {2618#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:38:03,436 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2618#true} {2618#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:38:03,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:38:03,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {2618#true} [102] L8-->L8-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[] {2618#true} is VALID [2022-04-08 00:38:03,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: 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] {2618#true} is VALID [2022-04-08 00:38:03,436 INFO L272 TraceCheckUtils]: 17: Hoare triple {2618#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:38:03,436 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2618#true} {2618#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:38:03,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:38:03,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {2618#true} [102] L8-->L8-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[] {2618#true} is VALID [2022-04-08 00:38:03,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: 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] {2618#true} is VALID [2022-04-08 00:38:03,436 INFO L272 TraceCheckUtils]: 12: Hoare triple {2618#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:38:03,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {2618#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2618#true} is VALID [2022-04-08 00:38:03,437 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2618#true} {2618#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:38:03,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:38:03,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {2618#true} [102] L8-->L8-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[] {2618#true} is VALID [2022-04-08 00:38:03,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: 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] {2618#true} is VALID [2022-04-08 00:38:03,437 INFO L272 TraceCheckUtils]: 6: Hoare triple {2618#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-08 00:38:03,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {2618#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2618#true} is VALID [2022-04-08 00:38:03,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {2618#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:38:03,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2618#true} {2618#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:38:03,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {2618#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:38:03,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {2618#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {2618#true} is VALID [2022-04-08 00:38:03,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {2618#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-08 00:38:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 00:38:03,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:38:03,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024507362] [2022-04-08 00:38:03,438 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:38:03,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773582256] [2022-04-08 00:38:03,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773582256] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:38:03,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:38:03,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-08 00:38:03,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998735697] [2022-04-08 00:38:03,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:38:03,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-08 00:38:03,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:38:03,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 00:38:03,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:03,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 00:38:03,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:38:03,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 00:38:03,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-08 00:38:03,469 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 00:38:03,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:03,851 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2022-04-08 00:38:03,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 00:38:03,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-08 00:38:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:38:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 00:38:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-08 00:38:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 00:38:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-08 00:38:03,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-08 00:38:03,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:03,894 INFO L225 Difference]: With dead ends: 88 [2022-04-08 00:38:03,894 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 00:38:03,894 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 00:38:03,895 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 00:38:03,895 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 130 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 00:38:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 00:38:03,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-08 00:38:03,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:38:03,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 00:38:03,956 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 00:38:03,956 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 00:38:03,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:03,960 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-08 00:38:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-08 00:38:03,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:03,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:03,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-08 00:38:03,961 INFO L87 Difference]: Start difference. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-08 00:38:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:03,963 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-08 00:38:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-08 00:38:03,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:03,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:03,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:38:03,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:38:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 00:38:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2022-04-08 00:38:03,966 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 54 [2022-04-08 00:38:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:38:03,967 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2022-04-08 00:38:03,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 00:38:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-08 00:38:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 00:38:03,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:38:03,968 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:38:03,987 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 00:38:04,180 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:04,180 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:38:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:38:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2126309122, now seen corresponding path program 2 times [2022-04-08 00:38:04,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:38:04,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007043140] [2022-04-08 00:38:04,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:04,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:38:04,194 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:38:04,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [915068887] [2022-04-08 00:38:04,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 00:38:04,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:04,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:38:04,203 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 00:38:04,205 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 00:38:04,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 00:38:04,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 00:38:04,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 00:38:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:04,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:38:04,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {3384#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:04,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {3384#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {3384#true} is VALID [2022-04-08 00:38:04,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {3384#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:04,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3384#true} {3384#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:04,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {3384#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:04,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {3384#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3384#true} is VALID [2022-04-08 00:38:04,837 INFO L272 TraceCheckUtils]: 6: Hoare triple {3384#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-08 00:38:04,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: 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] {3410#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:38:04,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {3410#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {3414#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:04,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {3414#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3414#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:04,842 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3414#(not (= |assume_abort_if_not_#in~cond| 0))} {3384#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:38:04,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:38:04,843 INFO L272 TraceCheckUtils]: 12: Hoare triple {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-08 00:38:04,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: 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] {3384#true} is VALID [2022-04-08 00:38:04,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {3384#true} [102] L8-->L8-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[] {3384#true} is VALID [2022-04-08 00:38:04,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {3384#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:04,843 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3384#true} {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:38:04,844 INFO L272 TraceCheckUtils]: 17: Hoare triple {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-08 00:38:04,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: 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] {3384#true} is VALID [2022-04-08 00:38:04,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {3384#true} [102] L8-->L8-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[] {3384#true} is VALID [2022-04-08 00:38:04,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {3384#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:04,852 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3384#true} {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:38:04,852 INFO L272 TraceCheckUtils]: 22: Hoare triple {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-08 00:38:04,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: 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] {3410#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:38:04,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {3410#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {3414#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:04,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {3414#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3414#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:04,856 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3414#(not (= |assume_abort_if_not_#in~cond| 0))} {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3470#(and (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:38:04,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {3470#(and (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 00:38:04,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 00:38:04,858 INFO L272 TraceCheckUtils]: 29: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3384#true} is VALID [2022-04-08 00:38:04,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: 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] {3384#true} is VALID [2022-04-08 00:38:04,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {3384#true} [117] L11-->L11-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[] {3384#true} is VALID [2022-04-08 00:38:04,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {3384#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:04,858 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3384#true} {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 00:38:04,858 INFO L272 TraceCheckUtils]: 34: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3384#true} is VALID [2022-04-08 00:38:04,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: 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] {3384#true} is VALID [2022-04-08 00:38:04,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {3384#true} [117] L11-->L11-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[] {3384#true} is VALID [2022-04-08 00:38:04,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {3384#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:04,863 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3384#true} {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 00:38:04,864 INFO L272 TraceCheckUtils]: 39: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3384#true} is VALID [2022-04-08 00:38:04,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: 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] {3514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:38:04,864 INFO L290 TraceCheckUtils]: 41: Hoare triple {3514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [117] L11-->L11-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[] {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:38:04,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:38:04,865 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 00:38:04,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 00:38:04,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 00:38:04,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 00:38:04,867 INFO L272 TraceCheckUtils]: 47: Hoare triple {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3384#true} is VALID [2022-04-08 00:38:04,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: 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] {3384#true} is VALID [2022-04-08 00:38:04,867 INFO L290 TraceCheckUtils]: 49: Hoare triple {3384#true} [117] L11-->L11-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[] {3384#true} is VALID [2022-04-08 00:38:04,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {3384#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:04,868 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3384#true} {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 00:38:04,868 INFO L272 TraceCheckUtils]: 52: Hoare triple {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3553#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:38:04,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {3553#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: 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] {3557#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:38:04,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {3557#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: 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[] {3385#false} is VALID [2022-04-08 00:38:04,869 INFO L290 TraceCheckUtils]: 55: Hoare triple {3385#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3385#false} is VALID [2022-04-08 00:38:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 00:38:04,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:38:22,171 INFO L290 TraceCheckUtils]: 55: Hoare triple {3385#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3385#false} is VALID [2022-04-08 00:38:22,171 INFO L290 TraceCheckUtils]: 54: Hoare triple {3557#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: 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[] {3385#false} is VALID [2022-04-08 00:38:22,172 INFO L290 TraceCheckUtils]: 53: Hoare triple {3553#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: 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] {3557#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:38:22,172 INFO L272 TraceCheckUtils]: 52: Hoare triple {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3553#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:38:22,173 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3384#true} {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:38:22,173 INFO L290 TraceCheckUtils]: 50: Hoare triple {3384#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:22,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {3384#true} [117] L11-->L11-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[] {3384#true} is VALID [2022-04-08 00:38:22,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: 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] {3384#true} is VALID [2022-04-08 00:38:22,174 INFO L272 TraceCheckUtils]: 47: Hoare triple {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3384#true} is VALID [2022-04-08 00:38:22,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:38:22,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {3595#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:38:22,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {3595#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {3595#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 00:38:22,561 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3595#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 00:38:22,561 INFO L290 TraceCheckUtils]: 42: Hoare triple {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:38:22,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {3612#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [117] L11-->L11-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[] {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:38:22,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: 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] {3612#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 00:38:22,562 INFO L272 TraceCheckUtils]: 39: Hoare triple {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3384#true} is VALID [2022-04-08 00:38:22,563 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3384#true} {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:38:22,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {3384#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:22,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {3384#true} [117] L11-->L11-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[] {3384#true} is VALID [2022-04-08 00:38:22,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: 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] {3384#true} is VALID [2022-04-08 00:38:22,563 INFO L272 TraceCheckUtils]: 34: Hoare triple {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3384#true} is VALID [2022-04-08 00:38:22,566 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3384#true} {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:38:22,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {3384#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:22,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {3384#true} [117] L11-->L11-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[] {3384#true} is VALID [2022-04-08 00:38:22,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: 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] {3384#true} is VALID [2022-04-08 00:38:22,567 INFO L272 TraceCheckUtils]: 29: Hoare triple {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3384#true} is VALID [2022-04-08 00:38:22,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:38:22,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {3384#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:38:22,568 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3384#true} {3384#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-08 00:38:22,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {3384#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:22,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {3384#true} [102] L8-->L8-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[] {3384#true} is VALID [2022-04-08 00:38:22,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: 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] {3384#true} is VALID [2022-04-08 00:38:22,568 INFO L272 TraceCheckUtils]: 22: Hoare triple {3384#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-08 00:38:22,568 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3384#true} {3384#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-08 00:38:22,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {3384#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:22,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {3384#true} [102] L8-->L8-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[] {3384#true} is VALID [2022-04-08 00:38:22,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: 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] {3384#true} is VALID [2022-04-08 00:38:22,569 INFO L272 TraceCheckUtils]: 17: Hoare triple {3384#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-08 00:38:22,569 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3384#true} {3384#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-08 00:38:22,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {3384#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:22,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {3384#true} [102] L8-->L8-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[] {3384#true} is VALID [2022-04-08 00:38:22,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: 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] {3384#true} is VALID [2022-04-08 00:38:22,569 INFO L272 TraceCheckUtils]: 12: Hoare triple {3384#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-08 00:38:22,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {3384#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {3384#true} is VALID [2022-04-08 00:38:22,569 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3384#true} {3384#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-08 00:38:22,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {3384#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:22,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {3384#true} [102] L8-->L8-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[] {3384#true} is VALID [2022-04-08 00:38:22,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: 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] {3384#true} is VALID [2022-04-08 00:38:22,569 INFO L272 TraceCheckUtils]: 6: Hoare triple {3384#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-08 00:38:22,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {3384#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3384#true} is VALID [2022-04-08 00:38:22,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {3384#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:22,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3384#true} {3384#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:22,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {3384#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:22,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {3384#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {3384#true} is VALID [2022-04-08 00:38:22,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {3384#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-08 00:38:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 00:38:22,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:38:22,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007043140] [2022-04-08 00:38:22,571 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:38:22,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915068887] [2022-04-08 00:38:22,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915068887] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:38:22,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:38:22,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-08 00:38:22,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821708213] [2022-04-08 00:38:22,571 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:38:22,571 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) Word has length 56 [2022-04-08 00:38:22,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:38:22,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 00:38:22,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:22,670 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 00:38:22,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:38:22,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 00:38:22,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-04-08 00:38:22,671 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 00:38:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:25,372 INFO L93 Difference]: Finished difference Result 119 states and 153 transitions. [2022-04-08 00:38:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 00:38:25,373 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) Word has length 56 [2022-04-08 00:38:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:38:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 00:38:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 89 transitions. [2022-04-08 00:38:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 00:38:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 89 transitions. [2022-04-08 00:38:25,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 89 transitions. [2022-04-08 00:38:25,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:25,493 INFO L225 Difference]: With dead ends: 119 [2022-04-08 00:38:25,494 INFO L226 Difference]: Without dead ends: 117 [2022-04-08 00:38:25,494 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-04-08 00:38:25,494 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 00:38:25,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 156 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 00:38:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-08 00:38:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 96. [2022-04-08 00:38:25,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:38:25,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 00:38:25,573 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 00:38:25,573 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 00:38:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:25,588 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2022-04-08 00:38:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2022-04-08 00:38:25,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:25,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:25,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 117 states. [2022-04-08 00:38:25,589 INFO L87 Difference]: Start difference. First operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 117 states. [2022-04-08 00:38:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:25,592 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2022-04-08 00:38:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2022-04-08 00:38:25,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:25,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:25,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:38:25,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:38:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 00:38:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2022-04-08 00:38:25,595 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 56 [2022-04-08 00:38:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:38:25,595 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2022-04-08 00:38:25,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 00:38:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2022-04-08 00:38:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 00:38:25,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:38:25,596 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 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 00:38:25,627 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 00:38:25,796 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:25,797 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:38:25,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:38:25,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1746772058, now seen corresponding path program 1 times [2022-04-08 00:38:25,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:38:25,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336667511] [2022-04-08 00:38:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:25,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:38:25,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:38:25,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316762061] [2022-04-08 00:38:25,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:25,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:25,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:38:25,809 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 00:38:25,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 00:38:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:25,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 00:38:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:25,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:38:26,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {4305#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:26,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {4305#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {4305#true} is VALID [2022-04-08 00:38:26,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {4305#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:26,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4305#true} {4305#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:26,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {4305#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:26,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {4305#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4305#true} is VALID [2022-04-08 00:38:26,318 INFO L272 TraceCheckUtils]: 6: Hoare triple {4305#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:26,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: 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] {4305#true} is VALID [2022-04-08 00:38:26,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {4305#true} [102] L8-->L8-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[] {4305#true} is VALID [2022-04-08 00:38:26,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:26,318 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4305#true} {4305#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:26,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {4305#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {4305#true} is VALID [2022-04-08 00:38:26,318 INFO L272 TraceCheckUtils]: 12: Hoare triple {4305#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:26,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: 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] {4305#true} is VALID [2022-04-08 00:38:26,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {4305#true} [102] L8-->L8-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[] {4305#true} is VALID [2022-04-08 00:38:26,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:26,319 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4305#true} {4305#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:26,319 INFO L272 TraceCheckUtils]: 17: Hoare triple {4305#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:26,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: 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] {4364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:38:26,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {4364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {4368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:26,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {4368#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:26,323 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4368#(not (= |assume_abort_if_not_#in~cond| 0))} {4305#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4375#(<= 1 main_~x~0)} is VALID [2022-04-08 00:38:26,323 INFO L272 TraceCheckUtils]: 22: Hoare triple {4375#(<= 1 main_~x~0)} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:26,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: 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] {4305#true} is VALID [2022-04-08 00:38:26,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {4305#true} [102] L8-->L8-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[] {4305#true} is VALID [2022-04-08 00:38:26,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:26,325 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4305#true} {4375#(<= 1 main_~x~0)} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4375#(<= 1 main_~x~0)} is VALID [2022-04-08 00:38:26,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {4375#(<= 1 main_~x~0)} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:38:26,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:38:26,326 INFO L272 TraceCheckUtils]: 29: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4305#true} is VALID [2022-04-08 00:38:26,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: 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] {4305#true} is VALID [2022-04-08 00:38:26,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {4305#true} [117] L11-->L11-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[] {4305#true} is VALID [2022-04-08 00:38:26,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:26,327 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4305#true} {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:38:26,327 INFO L272 TraceCheckUtils]: 34: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4305#true} is VALID [2022-04-08 00:38:26,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: 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] {4305#true} is VALID [2022-04-08 00:38:26,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {4305#true} [117] L11-->L11-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[] {4305#true} is VALID [2022-04-08 00:38:26,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:26,328 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4305#true} {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:38:26,328 INFO L272 TraceCheckUtils]: 39: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4305#true} is VALID [2022-04-08 00:38:26,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: 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] {4305#true} is VALID [2022-04-08 00:38:26,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {4305#true} [117] L11-->L11-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[] {4305#true} is VALID [2022-04-08 00:38:26,328 INFO L290 TraceCheckUtils]: 42: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:26,329 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4305#true} {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:38:26,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:38:26,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 00:38:26,331 INFO L290 TraceCheckUtils]: 46: Hoare triple {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 00:38:26,331 INFO L272 TraceCheckUtils]: 47: Hoare triple {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4305#true} is VALID [2022-04-08 00:38:26,331 INFO L290 TraceCheckUtils]: 48: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: 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] {4305#true} is VALID [2022-04-08 00:38:26,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {4305#true} [117] L11-->L11-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[] {4305#true} is VALID [2022-04-08 00:38:26,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:26,332 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4305#true} {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 00:38:26,332 INFO L272 TraceCheckUtils]: 52: Hoare triple {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4305#true} is VALID [2022-04-08 00:38:26,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: 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] {4474#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:38:26,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {4474#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [117] L11-->L11-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[] {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:38:26,333 INFO L290 TraceCheckUtils]: 55: Hoare triple {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:38:26,334 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4485#(and (<= 1 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ main_~q~0 1) 0))} is VALID [2022-04-08 00:38:26,334 INFO L272 TraceCheckUtils]: 57: Hoare triple {4485#(and (<= 1 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ main_~q~0 1) 0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4489#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:38:26,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {4489#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: 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] {4493#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:38:26,335 INFO L290 TraceCheckUtils]: 59: Hoare triple {4493#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: 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[] {4306#false} is VALID [2022-04-08 00:38:26,335 INFO L290 TraceCheckUtils]: 60: Hoare triple {4306#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4306#false} is VALID [2022-04-08 00:38:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-08 00:38:26,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:38:42,132 INFO L290 TraceCheckUtils]: 60: Hoare triple {4306#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4306#false} is VALID [2022-04-08 00:38:42,132 INFO L290 TraceCheckUtils]: 59: Hoare triple {4493#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: 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[] {4306#false} is VALID [2022-04-08 00:38:42,133 INFO L290 TraceCheckUtils]: 58: Hoare triple {4489#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: 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] {4493#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:38:42,133 INFO L272 TraceCheckUtils]: 57: Hoare triple {4509#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4489#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:38:42,134 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4509#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:38:42,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:38:42,135 INFO L290 TraceCheckUtils]: 54: Hoare triple {4523#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [117] L11-->L11-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[] {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:38:42,135 INFO L290 TraceCheckUtils]: 53: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: 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] {4523#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 00:38:42,135 INFO L272 TraceCheckUtils]: 52: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4305#true} is VALID [2022-04-08 00:38:42,136 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4305#true} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:38:42,136 INFO L290 TraceCheckUtils]: 50: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:42,136 INFO L290 TraceCheckUtils]: 49: Hoare triple {4305#true} [117] L11-->L11-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[] {4305#true} is VALID [2022-04-08 00:38:42,136 INFO L290 TraceCheckUtils]: 48: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: 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] {4305#true} is VALID [2022-04-08 00:38:42,136 INFO L272 TraceCheckUtils]: 47: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4305#true} is VALID [2022-04-08 00:38:42,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:38:42,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:38:42,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:38:42,885 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4305#true} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:38:42,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:42,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {4305#true} [117] L11-->L11-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[] {4305#true} is VALID [2022-04-08 00:38:42,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: 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] {4305#true} is VALID [2022-04-08 00:38:42,886 INFO L272 TraceCheckUtils]: 39: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4305#true} is VALID [2022-04-08 00:38:42,886 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4305#true} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:38:42,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:42,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {4305#true} [117] L11-->L11-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[] {4305#true} is VALID [2022-04-08 00:38:42,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: 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] {4305#true} is VALID [2022-04-08 00:38:42,887 INFO L272 TraceCheckUtils]: 34: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4305#true} is VALID [2022-04-08 00:38:42,887 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4305#true} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:38:42,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:42,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {4305#true} [117] L11-->L11-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[] {4305#true} is VALID [2022-04-08 00:38:42,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: 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] {4305#true} is VALID [2022-04-08 00:38:42,887 INFO L272 TraceCheckUtils]: 29: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4305#true} is VALID [2022-04-08 00:38:42,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:38:42,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {4305#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:38:42,888 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4305#true} {4305#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:42,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:42,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {4305#true} [102] L8-->L8-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[] {4305#true} is VALID [2022-04-08 00:38:42,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: 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] {4305#true} is VALID [2022-04-08 00:38:42,889 INFO L272 TraceCheckUtils]: 22: Hoare triple {4305#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:42,889 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4305#true} {4305#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:42,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:42,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {4305#true} [102] L8-->L8-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[] {4305#true} is VALID [2022-04-08 00:38:42,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: 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] {4305#true} is VALID [2022-04-08 00:38:42,889 INFO L272 TraceCheckUtils]: 17: Hoare triple {4305#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:42,889 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4305#true} {4305#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:42,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:42,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {4305#true} [102] L8-->L8-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[] {4305#true} is VALID [2022-04-08 00:38:42,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: 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] {4305#true} is VALID [2022-04-08 00:38:42,889 INFO L272 TraceCheckUtils]: 12: Hoare triple {4305#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:42,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {4305#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {4305#true} is VALID [2022-04-08 00:38:42,890 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4305#true} {4305#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:42,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:42,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {4305#true} [102] L8-->L8-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[] {4305#true} is VALID [2022-04-08 00:38:42,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: 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] {4305#true} is VALID [2022-04-08 00:38:42,890 INFO L272 TraceCheckUtils]: 6: Hoare triple {4305#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-08 00:38:42,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {4305#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4305#true} is VALID [2022-04-08 00:38:42,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {4305#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:42,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4305#true} {4305#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:42,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {4305#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:42,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {4305#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {4305#true} is VALID [2022-04-08 00:38:42,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {4305#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-08 00:38:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 00:38:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:38:42,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336667511] [2022-04-08 00:38:42,891 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:38:42,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316762061] [2022-04-08 00:38:42,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316762061] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:38:42,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:38:42,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-08 00:38:42,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447988265] [2022-04-08 00:38:42,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:38:42,892 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) Word has length 61 [2022-04-08 00:38:42,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:38:42,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-08 00:38:43,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:43,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 00:38:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:38:43,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 00:38:43,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-08 00:38:43,216 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-08 00:38:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:45,169 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2022-04-08 00:38:45,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 00:38:45,169 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) Word has length 61 [2022-04-08 00:38:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:38:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-08 00:38:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 98 transitions. [2022-04-08 00:38:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-08 00:38:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 98 transitions. [2022-04-08 00:38:45,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 98 transitions. [2022-04-08 00:38:45,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:45,315 INFO L225 Difference]: With dead ends: 133 [2022-04-08 00:38:45,315 INFO L226 Difference]: Without dead ends: 122 [2022-04-08 00:38:45,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-08 00:38:45,316 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 00:38:45,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 159 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 00:38:45,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-08 00:38:45,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2022-04-08 00:38:45,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:38:45,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 00:38:45,416 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 00:38:45,416 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 00:38:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:45,419 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2022-04-08 00:38:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-04-08 00:38:45,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:45,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:45,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 122 states. [2022-04-08 00:38:45,419 INFO L87 Difference]: Start difference. First operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 122 states. [2022-04-08 00:38:45,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:45,422 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2022-04-08 00:38:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-04-08 00:38:45,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:45,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:45,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:38:45,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:38:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 00:38:45,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-04-08 00:38:45,426 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 61 [2022-04-08 00:38:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:38:45,426 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-04-08 00:38:45,426 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-08 00:38:45,426 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-08 00:38:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 00:38:45,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:38:45,427 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:38:45,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 00:38:45,644 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 00:38:45,644 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:38:45,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:38:45,645 INFO L85 PathProgramCache]: Analyzing trace with hash -296466288, now seen corresponding path program 1 times [2022-04-08 00:38:45,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:38:45,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961749124] [2022-04-08 00:38:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:45,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:38:45,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:38:45,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612695272] [2022-04-08 00:38:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:45,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:45,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:38:45,657 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 00:38:45,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 00:38:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:45,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 00:38:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:45,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:38:46,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {5295#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {5295#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {5295#true} is VALID [2022-04-08 00:38:46,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {5295#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5295#true} {5295#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {5295#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {5295#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5295#true} is VALID [2022-04-08 00:38:46,108 INFO L272 TraceCheckUtils]: 6: Hoare triple {5295#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-08 00:38:46,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: 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] {5321#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:38:46,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {5321#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {5325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:46,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {5325#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:46,110 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5325#(not (= |assume_abort_if_not_#in~cond| 0))} {5295#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:38:46,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:38:46,110 INFO L272 TraceCheckUtils]: 12: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-08 00:38:46,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: 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] {5295#true} is VALID [2022-04-08 00:38:46,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {5295#true} [102] L8-->L8-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[] {5295#true} is VALID [2022-04-08 00:38:46,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {5295#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,111 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5295#true} {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:38:46,111 INFO L272 TraceCheckUtils]: 17: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-08 00:38:46,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: 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] {5295#true} is VALID [2022-04-08 00:38:46,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {5295#true} [102] L8-->L8-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[] {5295#true} is VALID [2022-04-08 00:38:46,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {5295#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,112 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5295#true} {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:38:46,112 INFO L272 TraceCheckUtils]: 22: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-08 00:38:46,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: 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] {5295#true} is VALID [2022-04-08 00:38:46,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {5295#true} [102] L8-->L8-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[] {5295#true} is VALID [2022-04-08 00:38:46,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {5295#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,112 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5295#true} {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 00:38:46,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-08 00:38:46,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {5384#(<= main_~a~0 2)} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5384#(<= main_~a~0 2)} is VALID [2022-04-08 00:38:46,113 INFO L272 TraceCheckUtils]: 29: Hoare triple {5384#(<= main_~a~0 2)} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5295#true} is VALID [2022-04-08 00:38:46,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: 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] {5295#true} is VALID [2022-04-08 00:38:46,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {5295#true} [117] L11-->L11-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[] {5295#true} is VALID [2022-04-08 00:38:46,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,114 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-08 00:38:46,114 INFO L272 TraceCheckUtils]: 34: Hoare triple {5384#(<= main_~a~0 2)} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5295#true} is VALID [2022-04-08 00:38:46,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: 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] {5295#true} is VALID [2022-04-08 00:38:46,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {5295#true} [117] L11-->L11-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[] {5295#true} is VALID [2022-04-08 00:38:46,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,115 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-08 00:38:46,115 INFO L272 TraceCheckUtils]: 39: Hoare triple {5384#(<= main_~a~0 2)} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5295#true} is VALID [2022-04-08 00:38:46,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: 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] {5295#true} is VALID [2022-04-08 00:38:46,115 INFO L290 TraceCheckUtils]: 41: Hoare triple {5295#true} [117] L11-->L11-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[] {5295#true} is VALID [2022-04-08 00:38:46,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,116 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-08 00:38:46,116 INFO L290 TraceCheckUtils]: 44: Hoare triple {5384#(<= main_~a~0 2)} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {5384#(<= main_~a~0 2)} is VALID [2022-04-08 00:38:46,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {5384#(<= main_~a~0 2)} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-08 00:38:46,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-08 00:38:46,117 INFO L272 TraceCheckUtils]: 47: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5295#true} is VALID [2022-04-08 00:38:46,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: 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] {5295#true} is VALID [2022-04-08 00:38:46,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {5295#true} [117] L11-->L11-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[] {5295#true} is VALID [2022-04-08 00:38:46,117 INFO L290 TraceCheckUtils]: 50: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,118 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5295#true} {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-08 00:38:46,118 INFO L272 TraceCheckUtils]: 52: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5295#true} is VALID [2022-04-08 00:38:46,118 INFO L290 TraceCheckUtils]: 53: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: 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] {5295#true} is VALID [2022-04-08 00:38:46,118 INFO L290 TraceCheckUtils]: 54: Hoare triple {5295#true} [117] L11-->L11-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[] {5295#true} is VALID [2022-04-08 00:38:46,118 INFO L290 TraceCheckUtils]: 55: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,119 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5295#true} {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-08 00:38:46,119 INFO L272 TraceCheckUtils]: 57: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5295#true} is VALID [2022-04-08 00:38:46,119 INFO L290 TraceCheckUtils]: 58: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: 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] {5295#true} is VALID [2022-04-08 00:38:46,119 INFO L290 TraceCheckUtils]: 59: Hoare triple {5295#true} [117] L11-->L11-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[] {5295#true} is VALID [2022-04-08 00:38:46,119 INFO L290 TraceCheckUtils]: 60: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,119 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5295#true} {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-08 00:38:46,120 INFO L290 TraceCheckUtils]: 62: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {5491#(and (< 0 main_~a~0) (not (= main_~b~0 main_~a~0)) (< main_~b~0 2))} is VALID [2022-04-08 00:38:46,120 INFO L290 TraceCheckUtils]: 63: Hoare triple {5491#(and (< 0 main_~a~0) (not (= main_~b~0 main_~a~0)) (< main_~b~0 2))} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {5296#false} is VALID [2022-04-08 00:38:46,121 INFO L290 TraceCheckUtils]: 64: Hoare triple {5296#false} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5296#false} is VALID [2022-04-08 00:38:46,121 INFO L272 TraceCheckUtils]: 65: Hoare triple {5296#false} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5296#false} is VALID [2022-04-08 00:38:46,121 INFO L290 TraceCheckUtils]: 66: Hoare triple {5296#false} [113] __VERIFIER_assertENTRY-->L11: 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] {5296#false} is VALID [2022-04-08 00:38:46,121 INFO L290 TraceCheckUtils]: 67: Hoare triple {5296#false} [116] L11-->L12: 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[] {5296#false} is VALID [2022-04-08 00:38:46,121 INFO L290 TraceCheckUtils]: 68: Hoare triple {5296#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5296#false} is VALID [2022-04-08 00:38:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-08 00:38:46,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:38:46,583 INFO L290 TraceCheckUtils]: 68: Hoare triple {5296#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5296#false} is VALID [2022-04-08 00:38:46,583 INFO L290 TraceCheckUtils]: 67: Hoare triple {5296#false} [116] L11-->L12: 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[] {5296#false} is VALID [2022-04-08 00:38:46,583 INFO L290 TraceCheckUtils]: 66: Hoare triple {5296#false} [113] __VERIFIER_assertENTRY-->L11: 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] {5296#false} is VALID [2022-04-08 00:38:46,584 INFO L272 TraceCheckUtils]: 65: Hoare triple {5296#false} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5296#false} is VALID [2022-04-08 00:38:46,584 INFO L290 TraceCheckUtils]: 64: Hoare triple {5296#false} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5296#false} is VALID [2022-04-08 00:38:46,584 INFO L290 TraceCheckUtils]: 63: Hoare triple {5525#(< main_~b~0 main_~a~0)} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {5296#false} is VALID [2022-04-08 00:38:46,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {5525#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 00:38:46,585 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5295#true} {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-08 00:38:46,585 INFO L290 TraceCheckUtils]: 60: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,585 INFO L290 TraceCheckUtils]: 59: Hoare triple {5295#true} [117] L11-->L11-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[] {5295#true} is VALID [2022-04-08 00:38:46,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: 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] {5295#true} is VALID [2022-04-08 00:38:46,585 INFO L272 TraceCheckUtils]: 57: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5295#true} is VALID [2022-04-08 00:38:46,586 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5295#true} {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-08 00:38:46,586 INFO L290 TraceCheckUtils]: 55: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,586 INFO L290 TraceCheckUtils]: 54: Hoare triple {5295#true} [117] L11-->L11-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[] {5295#true} is VALID [2022-04-08 00:38:46,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: 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] {5295#true} is VALID [2022-04-08 00:38:46,586 INFO L272 TraceCheckUtils]: 52: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5295#true} is VALID [2022-04-08 00:38:46,586 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5295#true} {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-08 00:38:46,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,587 INFO L290 TraceCheckUtils]: 49: Hoare triple {5295#true} [117] L11-->L11-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[] {5295#true} is VALID [2022-04-08 00:38:46,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: 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] {5295#true} is VALID [2022-04-08 00:38:46,587 INFO L272 TraceCheckUtils]: 47: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5295#true} is VALID [2022-04-08 00:38:46,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-08 00:38:46,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {5384#(<= main_~a~0 2)} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-08 00:38:46,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {5384#(<= main_~a~0 2)} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {5384#(<= main_~a~0 2)} is VALID [2022-04-08 00:38:46,589 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-08 00:38:46,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {5295#true} [117] L11-->L11-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[] {5295#true} is VALID [2022-04-08 00:38:46,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: 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] {5295#true} is VALID [2022-04-08 00:38:46,589 INFO L272 TraceCheckUtils]: 39: Hoare triple {5384#(<= main_~a~0 2)} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5295#true} is VALID [2022-04-08 00:38:46,603 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-08 00:38:46,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {5295#true} [117] L11-->L11-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[] {5295#true} is VALID [2022-04-08 00:38:46,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: 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] {5295#true} is VALID [2022-04-08 00:38:46,604 INFO L272 TraceCheckUtils]: 34: Hoare triple {5384#(<= main_~a~0 2)} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5295#true} is VALID [2022-04-08 00:38:46,604 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-08 00:38:46,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {5295#true} [117] L11-->L11-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[] {5295#true} is VALID [2022-04-08 00:38:46,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: 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] {5295#true} is VALID [2022-04-08 00:38:46,605 INFO L272 TraceCheckUtils]: 29: Hoare triple {5384#(<= main_~a~0 2)} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5295#true} is VALID [2022-04-08 00:38:46,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {5384#(<= main_~a~0 2)} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5384#(<= main_~a~0 2)} is VALID [2022-04-08 00:38:46,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {5635#(<= main_~x~0 2)} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-08 00:38:46,606 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5295#true} {5635#(<= main_~x~0 2)} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5635#(<= main_~x~0 2)} is VALID [2022-04-08 00:38:46,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {5295#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {5295#true} [102] L8-->L8-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[] {5295#true} is VALID [2022-04-08 00:38:46,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: 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] {5295#true} is VALID [2022-04-08 00:38:46,606 INFO L272 TraceCheckUtils]: 22: Hoare triple {5635#(<= main_~x~0 2)} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-08 00:38:46,606 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5295#true} {5635#(<= main_~x~0 2)} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5635#(<= main_~x~0 2)} is VALID [2022-04-08 00:38:46,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {5295#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {5295#true} [102] L8-->L8-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[] {5295#true} is VALID [2022-04-08 00:38:46,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: 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] {5295#true} is VALID [2022-04-08 00:38:46,607 INFO L272 TraceCheckUtils]: 17: Hoare triple {5635#(<= main_~x~0 2)} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-08 00:38:46,607 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5295#true} {5635#(<= main_~x~0 2)} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5635#(<= main_~x~0 2)} is VALID [2022-04-08 00:38:46,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {5295#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {5295#true} [102] L8-->L8-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[] {5295#true} is VALID [2022-04-08 00:38:46,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: 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] {5295#true} is VALID [2022-04-08 00:38:46,607 INFO L272 TraceCheckUtils]: 12: Hoare triple {5635#(<= main_~x~0 2)} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-08 00:38:46,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {5635#(<= main_~x~0 2)} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {5635#(<= main_~x~0 2)} is VALID [2022-04-08 00:38:46,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5325#(not (= |assume_abort_if_not_#in~cond| 0))} {5295#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5635#(<= main_~x~0 2)} is VALID [2022-04-08 00:38:46,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {5325#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:46,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {5696#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [102] L8-->L8-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[] {5325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:46,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: 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] {5696#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 00:38:46,609 INFO L272 TraceCheckUtils]: 6: Hoare triple {5295#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-08 00:38:46,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {5295#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5295#true} is VALID [2022-04-08 00:38:46,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {5295#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5295#true} {5295#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {5295#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {5295#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {5295#true} is VALID [2022-04-08 00:38:46,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {5295#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-08 00:38:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-08 00:38:46,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:38:46,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961749124] [2022-04-08 00:38:46,610 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:38:46,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612695272] [2022-04-08 00:38:46,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612695272] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:38:46,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:38:46,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-08 00:38:46,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375420749] [2022-04-08 00:38:46,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:38:46,611 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 69 [2022-04-08 00:38:46,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:38:46,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 00:38:46,658 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 00:38:46,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 00:38:46,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:38:46,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 00:38:46,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-08 00:38:46,659 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 00:38:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:47,112 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-04-08 00:38:47,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 00:38:47,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 69 [2022-04-08 00:38:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:38:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 00:38:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-08 00:38:47,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 00:38:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-08 00:38:47,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-04-08 00:38:47,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:47,173 INFO L225 Difference]: With dead ends: 138 [2022-04-08 00:38:47,173 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 00:38:47,174 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-04-08 00:38:47,174 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 23 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 00:38:47,174 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 141 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 00:38:47,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 00:38:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-08 00:38:47,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:38:47,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 00:38:47,256 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 00:38:47,257 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 00:38:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:47,258 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-04-08 00:38:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-08 00:38:47,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:47,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:47,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 86 states. [2022-04-08 00:38:47,259 INFO L87 Difference]: Start difference. First operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 86 states. [2022-04-08 00:38:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:47,260 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-04-08 00:38:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-08 00:38:47,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:47,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:47,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:38:47,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:38:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 00:38:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-04-08 00:38:47,263 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 69 [2022-04-08 00:38:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:38:47,263 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-04-08 00:38:47,264 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-08 00:38:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-08 00:38:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 00:38:47,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:38:47,265 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:38:47,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 00:38:47,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 00:38:47,476 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:38:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:38:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash -392102192, now seen corresponding path program 2 times [2022-04-08 00:38:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:38:47,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944314858] [2022-04-08 00:38:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:47,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:38:47,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:38:47,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304092026] [2022-04-08 00:38:47,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 00:38:47,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:47,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:38:47,493 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 00:38:47,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 00:38:47,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 00:38:47,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 00:38:47,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 00:38:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:47,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:38:47,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {6224#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:47,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {6224#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {6224#true} is VALID [2022-04-08 00:38:47,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {6224#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:47,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6224#true} {6224#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:47,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {6224#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:47,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {6224#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6224#true} is VALID [2022-04-08 00:38:47,870 INFO L272 TraceCheckUtils]: 6: Hoare triple {6224#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-08 00:38:47,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: 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] {6224#true} is VALID [2022-04-08 00:38:47,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {6224#true} [102] L8-->L8-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[] {6224#true} is VALID [2022-04-08 00:38:47,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {6224#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:47,870 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6224#true} {6224#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-08 00:38:47,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {6224#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {6224#true} is VALID [2022-04-08 00:38:47,870 INFO L272 TraceCheckUtils]: 12: Hoare triple {6224#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-08 00:38:47,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: 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] {6268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:38:47,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {6268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {6272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:47,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {6272#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:47,872 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6272#(not (= |assume_abort_if_not_#in~cond| 0))} {6224#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 00:38:47,872 INFO L272 TraceCheckUtils]: 17: Hoare triple {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-08 00:38:47,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: 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] {6224#true} is VALID [2022-04-08 00:38:47,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {6224#true} [102] L8-->L8-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[] {6224#true} is VALID [2022-04-08 00:38:47,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {6224#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:47,872 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6224#true} {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 00:38:47,872 INFO L272 TraceCheckUtils]: 22: Hoare triple {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-08 00:38:47,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: 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] {6224#true} is VALID [2022-04-08 00:38:47,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {6224#true} [102] L8-->L8-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[] {6224#true} is VALID [2022-04-08 00:38:47,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {6224#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:47,874 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6224#true} {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 00:38:47,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-08 00:38:47,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {6313#(<= main_~b~0 2)} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6313#(<= main_~b~0 2)} is VALID [2022-04-08 00:38:47,875 INFO L272 TraceCheckUtils]: 29: Hoare triple {6313#(<= main_~b~0 2)} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6224#true} is VALID [2022-04-08 00:38:47,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: 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] {6224#true} is VALID [2022-04-08 00:38:47,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {6224#true} [117] L11-->L11-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[] {6224#true} is VALID [2022-04-08 00:38:47,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:47,875 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-08 00:38:47,875 INFO L272 TraceCheckUtils]: 34: Hoare triple {6313#(<= main_~b~0 2)} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6224#true} is VALID [2022-04-08 00:38:47,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: 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] {6224#true} is VALID [2022-04-08 00:38:47,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {6224#true} [117] L11-->L11-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[] {6224#true} is VALID [2022-04-08 00:38:47,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:47,877 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-08 00:38:47,877 INFO L272 TraceCheckUtils]: 39: Hoare triple {6313#(<= main_~b~0 2)} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6224#true} is VALID [2022-04-08 00:38:47,877 INFO L290 TraceCheckUtils]: 40: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: 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] {6224#true} is VALID [2022-04-08 00:38:47,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {6224#true} [117] L11-->L11-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[] {6224#true} is VALID [2022-04-08 00:38:47,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:47,878 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-08 00:38:47,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {6313#(<= main_~b~0 2)} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {6365#(and (<= main_~b~0 2) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-08 00:38:47,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {6365#(and (<= main_~b~0 2) (not (= main_~b~0 main_~a~0)))} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-08 00:38:47,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-08 00:38:47,893 INFO L272 TraceCheckUtils]: 47: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6224#true} is VALID [2022-04-08 00:38:47,893 INFO L290 TraceCheckUtils]: 48: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: 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] {6224#true} is VALID [2022-04-08 00:38:47,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {6224#true} [117] L11-->L11-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[] {6224#true} is VALID [2022-04-08 00:38:47,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:47,893 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6224#true} {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-08 00:38:47,893 INFO L272 TraceCheckUtils]: 52: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6224#true} is VALID [2022-04-08 00:38:47,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: 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] {6224#true} is VALID [2022-04-08 00:38:47,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {6224#true} [117] L11-->L11-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[] {6224#true} is VALID [2022-04-08 00:38:47,894 INFO L290 TraceCheckUtils]: 55: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:47,894 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6224#true} {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-08 00:38:47,894 INFO L272 TraceCheckUtils]: 57: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6224#true} is VALID [2022-04-08 00:38:47,894 INFO L290 TraceCheckUtils]: 58: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: 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] {6224#true} is VALID [2022-04-08 00:38:47,894 INFO L290 TraceCheckUtils]: 59: Hoare triple {6224#true} [117] L11-->L11-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[] {6224#true} is VALID [2022-04-08 00:38:47,895 INFO L290 TraceCheckUtils]: 60: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:47,895 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6224#true} {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-08 00:38:47,895 INFO L290 TraceCheckUtils]: 62: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-08 00:38:47,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {6225#false} is VALID [2022-04-08 00:38:47,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {6225#false} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6225#false} is VALID [2022-04-08 00:38:47,896 INFO L272 TraceCheckUtils]: 65: Hoare triple {6225#false} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6225#false} is VALID [2022-04-08 00:38:47,896 INFO L290 TraceCheckUtils]: 66: Hoare triple {6225#false} [113] __VERIFIER_assertENTRY-->L11: 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] {6225#false} is VALID [2022-04-08 00:38:47,896 INFO L290 TraceCheckUtils]: 67: Hoare triple {6225#false} [116] L11-->L12: 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[] {6225#false} is VALID [2022-04-08 00:38:47,897 INFO L290 TraceCheckUtils]: 68: Hoare triple {6225#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6225#false} is VALID [2022-04-08 00:38:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-08 00:38:47,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:38:48,234 INFO L290 TraceCheckUtils]: 68: Hoare triple {6225#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6225#false} is VALID [2022-04-08 00:38:48,234 INFO L290 TraceCheckUtils]: 67: Hoare triple {6225#false} [116] L11-->L12: 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[] {6225#false} is VALID [2022-04-08 00:38:48,234 INFO L290 TraceCheckUtils]: 66: Hoare triple {6225#false} [113] __VERIFIER_assertENTRY-->L11: 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] {6225#false} is VALID [2022-04-08 00:38:48,234 INFO L272 TraceCheckUtils]: 65: Hoare triple {6225#false} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6225#false} is VALID [2022-04-08 00:38:48,234 INFO L290 TraceCheckUtils]: 64: Hoare triple {6225#false} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6225#false} is VALID [2022-04-08 00:38:48,235 INFO L290 TraceCheckUtils]: 63: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {6225#false} is VALID [2022-04-08 00:38:48,235 INFO L290 TraceCheckUtils]: 62: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-08 00:38:48,236 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6224#true} {6454#(not (< main_~b~0 main_~a~0))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-08 00:38:48,236 INFO L290 TraceCheckUtils]: 60: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:48,236 INFO L290 TraceCheckUtils]: 59: Hoare triple {6224#true} [117] L11-->L11-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[] {6224#true} is VALID [2022-04-08 00:38:48,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: 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] {6224#true} is VALID [2022-04-08 00:38:48,236 INFO L272 TraceCheckUtils]: 57: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6224#true} is VALID [2022-04-08 00:38:48,236 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6224#true} {6454#(not (< main_~b~0 main_~a~0))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-08 00:38:48,236 INFO L290 TraceCheckUtils]: 55: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:48,237 INFO L290 TraceCheckUtils]: 54: Hoare triple {6224#true} [117] L11-->L11-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[] {6224#true} is VALID [2022-04-08 00:38:48,237 INFO L290 TraceCheckUtils]: 53: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: 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] {6224#true} is VALID [2022-04-08 00:38:48,237 INFO L272 TraceCheckUtils]: 52: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6224#true} is VALID [2022-04-08 00:38:48,237 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6224#true} {6454#(not (< main_~b~0 main_~a~0))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-08 00:38:48,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:48,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {6224#true} [117] L11-->L11-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[] {6224#true} is VALID [2022-04-08 00:38:48,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: 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] {6224#true} is VALID [2022-04-08 00:38:48,237 INFO L272 TraceCheckUtils]: 47: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6224#true} is VALID [2022-04-08 00:38:48,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-08 00:38:48,239 INFO L290 TraceCheckUtils]: 45: Hoare triple {6509#(or (< main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0))} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-08 00:38:48,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {6313#(<= main_~b~0 2)} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {6509#(or (< main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0))} is VALID [2022-04-08 00:38:48,240 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-08 00:38:48,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:48,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {6224#true} [117] L11-->L11-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[] {6224#true} is VALID [2022-04-08 00:38:48,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: 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] {6224#true} is VALID [2022-04-08 00:38:48,240 INFO L272 TraceCheckUtils]: 39: Hoare triple {6313#(<= main_~b~0 2)} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6224#true} is VALID [2022-04-08 00:38:48,240 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-08 00:38:48,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:48,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {6224#true} [117] L11-->L11-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[] {6224#true} is VALID [2022-04-08 00:38:48,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: 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] {6224#true} is VALID [2022-04-08 00:38:48,241 INFO L272 TraceCheckUtils]: 34: Hoare triple {6313#(<= main_~b~0 2)} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6224#true} is VALID [2022-04-08 00:38:48,241 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-08 00:38:48,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:48,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {6224#true} [117] L11-->L11-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[] {6224#true} is VALID [2022-04-08 00:38:48,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: 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] {6224#true} is VALID [2022-04-08 00:38:48,241 INFO L272 TraceCheckUtils]: 29: Hoare triple {6313#(<= main_~b~0 2)} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6224#true} is VALID [2022-04-08 00:38:48,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {6313#(<= main_~b~0 2)} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6313#(<= main_~b~0 2)} is VALID [2022-04-08 00:38:48,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {6564#(<= main_~y~0 2)} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-08 00:38:48,242 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6224#true} {6564#(<= main_~y~0 2)} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6564#(<= main_~y~0 2)} is VALID [2022-04-08 00:38:48,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {6224#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:48,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {6224#true} [102] L8-->L8-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[] {6224#true} is VALID [2022-04-08 00:38:48,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: 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] {6224#true} is VALID [2022-04-08 00:38:48,243 INFO L272 TraceCheckUtils]: 22: Hoare triple {6564#(<= main_~y~0 2)} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-08 00:38:48,243 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6224#true} {6564#(<= main_~y~0 2)} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6564#(<= main_~y~0 2)} is VALID [2022-04-08 00:38:48,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {6224#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:48,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {6224#true} [102] L8-->L8-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[] {6224#true} is VALID [2022-04-08 00:38:48,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: 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] {6224#true} is VALID [2022-04-08 00:38:48,243 INFO L272 TraceCheckUtils]: 17: Hoare triple {6564#(<= main_~y~0 2)} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-08 00:38:48,244 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6272#(not (= |assume_abort_if_not_#in~cond| 0))} {6224#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6564#(<= main_~y~0 2)} is VALID [2022-04-08 00:38:48,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {6272#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:48,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {6607#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [102] L8-->L8-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[] {6272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:48,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: 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] {6607#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 00:38:48,245 INFO L272 TraceCheckUtils]: 12: Hoare triple {6224#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-08 00:38:48,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {6224#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {6224#true} is VALID [2022-04-08 00:38:48,245 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6224#true} {6224#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-08 00:38:48,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {6224#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:48,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {6224#true} [102] L8-->L8-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[] {6224#true} is VALID [2022-04-08 00:38:48,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: 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] {6224#true} is VALID [2022-04-08 00:38:48,245 INFO L272 TraceCheckUtils]: 6: Hoare triple {6224#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-08 00:38:48,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {6224#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6224#true} is VALID [2022-04-08 00:38:48,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {6224#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:48,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6224#true} {6224#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:48,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {6224#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:48,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {6224#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {6224#true} is VALID [2022-04-08 00:38:48,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {6224#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-08 00:38:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-08 00:38:48,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:38:48,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944314858] [2022-04-08 00:38:48,246 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:38:48,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304092026] [2022-04-08 00:38:48,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304092026] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:38:48,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:38:48,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-08 00:38:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511568189] [2022-04-08 00:38:48,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:38:48,247 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 69 [2022-04-08 00:38:48,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:38:48,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 00:38:48,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:48,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 00:38:48,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:38:48,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 00:38:48,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-08 00:38:48,290 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 00:38:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:48,722 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2022-04-08 00:38:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 00:38:48,722 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 69 [2022-04-08 00:38:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:38:48,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 00:38:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2022-04-08 00:38:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 00:38:48,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2022-04-08 00:38:48,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2022-04-08 00:38:48,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:48,776 INFO L225 Difference]: With dead ends: 90 [2022-04-08 00:38:48,776 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 00:38:48,777 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-08 00:38:48,777 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 00:38:48,777 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 174 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 00:38:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 00:38:48,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 00:38:48,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:38:48,778 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 00:38:48,778 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 00:38:48,778 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 00:38:48,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:48,778 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 00:38:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 00:38:48,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:48,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:48,778 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 00:38:48,778 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 00:38:48,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:48,778 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 00:38:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 00:38:48,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:48,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:48,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:38:48,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:38:48,779 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 00:38:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 00:38:48,779 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-04-08 00:38:48,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:38:48,779 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 00:38:48,779 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 00:38:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 00:38:48,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:48,781 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 00:38:48,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 00:38:48,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 00:38:48,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 00:38:51,418 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 00:38:51,419 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-08 00:38:51,419 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-08 00:38:51,419 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 00:38:51,419 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 00:38:51,419 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-08 00:38:51,419 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-08 00:38:51,419 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-04-08 00:38:51,419 INFO L882 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-08 00:38:51,419 INFO L882 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-04-08 00:38:51,419 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-04-08 00:38:51,419 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 18 59) the Hoare annotation is: true [2022-04-08 00:38:51,419 INFO L885 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-08 00:38:51,419 INFO L882 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-04-08 00:38:51,419 INFO L878 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 2)) [2022-04-08 00:38:51,419 INFO L878 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2)) [2022-04-08 00:38:51,420 INFO L878 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2)) [2022-04-08 00:38:51,420 INFO L882 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-08 00:38:51,420 INFO L878 garLoopResultBuilder]: At program point L43-2(lines 35 52) the Hoare annotation is: (let ((.cse1 (<= main_~y~0 2)) (.cse2 (= main_~s~0 1)) (.cse7 (= main_~a~0 main_~x~0)) (.cse10 (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (.cse0 (<= 1 main_~x~0)) (.cse3 (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (.cse4 (= main_~b~0 main_~y~0)) (.cse5 (= main_~q~0 0)) (.cse6 (<= 1 main_~y~0)) (.cse8 (<= main_~x~0 2)) (.cse9 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 (< main_~a~0 2) (< 0 main_~b~0) .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse3 .cse4 (< 0 main_~a~0) .cse5 .cse6 (< main_~b~0 2) .cse8 .cse9))) [2022-04-08 00:38:51,420 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 52) the Hoare annotation is: (let ((.cse0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (let ((.cse1 (<= 1 main_~x~0)) (.cse2 (= main_~s~0 1)) (.cse3 (= main_~a~0 .cse0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~p~0 1))) (or (and (= main_~b~0 .cse0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse1 (<= main_~y~0 2) .cse2 .cse3 .cse4 (= main_~a~0 main_~x~0) .cse5) (and (= main_~b~0 main_~a~0) .cse1 .cse2 .cse3 (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse4 (<= main_~x~0 2) .cse5)))) [2022-04-08 00:38:51,420 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse1 (<= main_~y~0 2)) (.cse2 (= main_~s~0 1)) (.cse7 (= main_~a~0 main_~x~0)) (.cse10 (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (.cse0 (<= 1 main_~x~0)) (.cse3 (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (.cse4 (= main_~b~0 main_~y~0)) (.cse5 (= main_~q~0 0)) (.cse6 (<= 1 main_~y~0)) (.cse8 (<= main_~x~0 2)) (.cse9 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 (< main_~a~0 2) (< 0 main_~b~0) .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse3 .cse4 (< 0 main_~a~0) .cse5 .cse6 (< main_~b~0 2) .cse8 .cse9))) [2022-04-08 00:38:51,420 INFO L878 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (let ((.cse1 (<= 1 main_~x~0)) (.cse2 (= main_~s~0 1)) (.cse3 (= main_~a~0 .cse0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~p~0 1))) (or (and (= main_~b~0 .cse0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse1 (<= main_~y~0 2) .cse2 .cse3 .cse4 (= main_~a~0 main_~x~0) .cse5) (and (= main_~b~0 main_~a~0) .cse1 .cse2 .cse3 (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse4 (<= main_~x~0 2) .cse5)))) [2022-04-08 00:38:51,420 INFO L878 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse1 (<= main_~y~0 2)) (.cse2 (= main_~s~0 1)) (.cse7 (= main_~a~0 main_~x~0)) (.cse10 (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (.cse0 (<= 1 main_~x~0)) (.cse3 (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (.cse4 (= main_~b~0 main_~y~0)) (.cse5 (= main_~q~0 0)) (.cse6 (<= 1 main_~y~0)) (.cse8 (<= main_~x~0 2)) (.cse9 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 (< main_~a~0 2) (< 0 main_~b~0) .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse3 .cse4 (< 0 main_~a~0) .cse5 .cse6 (< main_~b~0 2) .cse8 .cse9))) [2022-04-08 00:38:51,420 INFO L878 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse5 (= main_~a~0 main_~x~0)) (.cse1 (<= 1 main_~x~0)) (.cse2 (<= main_~y~0 2)) (.cse3 (= main_~s~0 1)) (.cse7 (= main_~b~0 main_~y~0)) (.cse8 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse9 (<= main_~x~0 2)) (.cse6 (= main_~p~0 1))) (or (let ((.cse0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (and (= main_~b~0 .cse0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse1 .cse2 .cse3 (= main_~a~0 .cse0) .cse4 .cse5 .cse6)) (and (= main_~r~0 0) .cse1 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse9 .cse6) (and (= main_~b~0 main_~a~0) .cse1 .cse2 .cse3 .cse7 .cse8 .cse4 .cse9 .cse6))) [2022-04-08 00:38:51,420 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse3 (= main_~b~0 main_~y~0)) (.cse4 (= main_~q~0 0)) (.cse6 (<= main_~x~0 2)) (.cse0 (<= 1 main_~x~0)) (.cse8 (<= main_~y~0 2)) (.cse1 (= main_~s~0 1)) (.cse2 (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (.cse5 (<= 1 main_~y~0)) (.cse9 (= main_~a~0 main_~x~0)) (.cse7 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (< 0 main_~a~0) .cse4 .cse5 (< main_~b~0 2) .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse0 .cse8 .cse1 .cse2 (< main_~a~0 2) (< 0 main_~b~0) .cse5 .cse9 .cse7))) [2022-04-08 00:38:51,420 INFO L878 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (let ((.cse1 (<= 1 main_~x~0)) (.cse2 (<= main_~y~0 2)) (.cse3 (<= 1 main_~y~0)) (.cse4 (<= main_~x~0 2))) (or (let ((.cse0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (and (= main_~b~0 .cse0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse1 .cse2 (= main_~a~0 .cse0) .cse3 .cse4)) (and .cse1 .cse2 (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse3 .cse4))) [2022-04-08 00:38:51,420 INFO L882 garLoopResultBuilder]: For program point L38(lines 35 52) no Hoare annotation was computed. [2022-04-08 00:38:51,420 INFO L882 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-04-08 00:38:51,420 INFO L882 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2022-04-08 00:38:51,421 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 18 59) no Hoare annotation was computed. [2022-04-08 00:38:51,421 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 18 59) no Hoare annotation was computed. [2022-04-08 00:38:51,421 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 16) the Hoare annotation is: true [2022-04-08 00:38:51,421 INFO L882 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2022-04-08 00:38:51,421 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-04-08 00:38:51,421 INFO L882 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2022-04-08 00:38:51,421 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-04-08 00:38:51,421 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2022-04-08 00:38:51,423 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:38:51,424 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 00:38:51,432 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:38:51,433 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-08 00:38:51,434 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-08 00:38:51,434 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-08 00:38:51,434 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-08 00:38:51,434 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-08 00:38:51,440 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-08 00:38:51,440 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-08 00:38:51,440 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 00:38:51,440 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 00:38:51,440 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 00:38:51,440 INFO L163 areAnnotationChecker]: CFG has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 00:38:51,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:38:51 BasicIcfg [2022-04-08 00:38:51,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 00:38:51,453 INFO L158 Benchmark]: Toolchain (without parser) took 66633.70ms. Allocated memory was 180.4MB in the beginning and 270.5MB in the end (delta: 90.2MB). Free memory was 127.4MB in the beginning and 194.8MB in the end (delta: -67.4MB). Peak memory consumption was 126.0MB. Max. memory is 8.0GB. [2022-04-08 00:38:51,453 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory was 143.7MB in the beginning and 143.6MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 00:38:51,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.80ms. Allocated memory was 180.4MB in the beginning and 225.4MB in the end (delta: 45.1MB). Free memory was 127.1MB in the beginning and 201.2MB in the end (delta: -74.0MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-04-08 00:38:51,454 INFO L158 Benchmark]: Boogie Preprocessor took 23.31ms. Allocated memory is still 225.4MB. Free memory was 201.2MB in the beginning and 199.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 00:38:51,454 INFO L158 Benchmark]: RCFGBuilder took 268.09ms. Allocated memory is still 225.4MB. Free memory was 199.6MB in the beginning and 187.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 00:38:51,454 INFO L158 Benchmark]: IcfgTransformer took 31.20ms. Allocated memory is still 225.4MB. Free memory was 187.0MB in the beginning and 184.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 00:38:51,454 INFO L158 Benchmark]: TraceAbstraction took 66101.57ms. Allocated memory was 225.4MB in the beginning and 270.5MB in the end (delta: 45.1MB). Free memory was 184.4MB in the beginning and 194.8MB in the end (delta: -10.4MB). Peak memory consumption was 137.9MB. Max. memory is 8.0GB. [2022-04-08 00:38:51,455 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 180.4MB. Free memory was 143.7MB in the beginning and 143.6MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.80ms. Allocated memory was 180.4MB in the beginning and 225.4MB in the end (delta: 45.1MB). Free memory was 127.1MB in the beginning and 201.2MB in the end (delta: -74.0MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.31ms. Allocated memory is still 225.4MB. Free memory was 201.2MB in the beginning and 199.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 268.09ms. Allocated memory is still 225.4MB. Free memory was 199.6MB in the beginning and 187.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 31.20ms. Allocated memory is still 225.4MB. Free memory was 187.0MB in the beginning and 184.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 66101.57ms. Allocated memory was 225.4MB in the beginning and 270.5MB in the end (delta: 45.1MB). Free memory was 184.4MB in the beginning and 194.8MB in the end (delta: -10.4MB). Peak memory consumption was 137.9MB. 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: 13]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.0s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 1589 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1194 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1840 IncrementalHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 395 mSDtfsCounter, 1840 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 869 GetRequests, 750 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=9, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 69 PreInvPairs, 101 NumberOfFragments, 867 HoareAnnotationTreeSize, 69 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 18 FomulaSimplificationsInter, 2458 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 50.7s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 849 ConstructedInterpolants, 0 QuantifiedInterpolants, 2635 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1423 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 908/1002 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: 35]: Loop Invariant Derived loop invariant: ((((((((((1 <= x && y <= 2) && s == 1) && a == y * r + p * x) && b == y) && q == 0) && 1 <= y) && a == x) && x <= 2) && p == 1) || (((((((((b == q * x + y * s && 1 <= x) && y <= 2) && s == 1) && a == y * r + p * x) && a < 2) && 0 < b) && 1 <= y) && a == x) && p == 1)) || (((((((((b == q * x + y * s && 1 <= x) && a == y * r + p * x) && b == y) && 0 < a) && q == 0) && 1 <= y) && b < 2) && x <= 2) && p == 1) RESULT: Ultimate proved your program to be correct! [2022-04-08 00:38:51,475 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...